Moments of first hitting times for birth-death processes on trees

An explicit and recursive representation is presented for moments of the first hitting times of birth-death processes on trees. Based on that, the criteria on ergodicity, strong ergodicity, and l-ergodicity of the processes as well as a necessary condition for exponential ergodicity are obtained.     

拟生灭过程几种遍历性的判别准则(Ⅱ)

本文是文[7]的继续,研究了连续时间拟生灭过程,给出了一类连续时间拟生灭过程l-遍历和几何遍历行之有效的判别准则,并证明其不可能是多项式一致遍历和强遍历的.     

IPP+M/M／C排队的遍历性(英文)

The IP P＋M/M/c queueing system has been extensively used in the modern communication system.The existence and uniqueness of stationary distribution of the queue length L（t）for IP P＋M/M/1 queue has been proved in[10].In this paper,we shall give the su？cient and necessary conditions of l-ergodicity,geometric ergodicity,and prove that they are neither uniformly polynomial ergodicity nor strong ergodicity.     

GI/G/1排队系统的几种收敛速度

对随机模型,可以从不同角度研究其稳定性,一种是研究其转移概率函数趋向于平稳分布的速度,即各种遍历性;另一种是研究平稳分布的尾部衰减速度.本文从这两个方面着手,找它们之间的关系,对GI/G/1排队系统,给出等待时间列几何遍历、平稳分布轻尾与服务时间分布轻尾三者等价,l-遍历、平稳分布的尾部(l-1)-阶衰减与服务时间分布的尾部l-阶衰减三者等价,最后证明出等待时间列不是强遍历.     

Reconstructing finite group actions and characters from subgroup information

A finite group G is said to be action reconstructible if, for any action of G on a finite set, the numbers of orbits under restriction to each subgroup always give enough information to reconstruct the action up to equivalence. G is character reconstructible if, given any matrix representation of G, the mean value of the character on each subgroup always gives enough information to reconstruct the character. The conjugacy matrix of G is the matrix whose (ij) entry is the number of elements of the jth conjugacy class belonging to a typical subgroup of the ith subgroup conjugacy class. It is shown that G is action reconstructible if and only if the rows of this matrix are linearly independent (which is in turn true if and only if G is cyclic), and is character reconstructible if and only if the columns are linearly independent (which is true if and only if any two elements of G which generate conjugate cyclic subgroups are themselves conjugate).     

K-本原环的结构

研究K-本原环.证明了素环R是K-本原环当且仅当R含有一个非零理想I是K-本原环,当且仅当eRe是K-本原环,其中e是R的非零幂等元.并证明了GPI素环是K-本原环.推广了文献中的相应结果.     

Flow equivalence and orbit equivalence for shifts of finite type and isomorphism of their groupoids

We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite type. This generalises a result of Matsumoto and Matui from the irreducible to the general case. We also prove that a pair of one-sided shift spaces of finite type are continuously orbit equivalent if and only if their groupoids are isomorphic, and that the corresponding two-sided shifts are flow equivalent if and only if the groupoids are stably isomorphic. As applications we show that two finite directed graphs with no sinks and no sources are move equivalent if and only if the corresponding graph $C^{?}$-algebras are stably isomorphic by a diagonal-preserving isomorphism (if and only if the corresponding Leavitt path algebras are stably isomorphic by a diagonal-preserving isomorphism), and that two topological Markov chains are flow equivalent if and only if there is a diagonal-preserving isomorphism between the stabilisations of the corresponding Cuntz–Krieger algebras (the latter generalises a result of Matsumoto and Matui about irreducible topological Markov chains with no isolated points to a result about general topological Markov chains). We also show that for general shift spaces, strongly continuous orbit equivalence implies two-sided conjugacy.     

INDEPENDENT-SET-DELETABLE FACTOR-CRITICAL POWER GRAPHS

It is said that a graph G is independent-set-deletable factor-critical (in short, ID-factor-critical), if, for every independent set 7 which has the same parity as |V(G)|, G-I has a perfect matching. A graph G is strongly IM-extendable, if for every spanning supergraph H of G, every induced matching of H is included in a perfect matching of H. The k-th power of G, denoted by Gk, is the graph with vertex set V(G) in which two vertices are adjacent if and only if they have distance at most k in G. ID-factor-criticality and IM-extendability of power graphs are discussed in this article. The author shows that, if G is a connected graph, then G3 and T(G) (the total graph of G) are ID-factor-critical, and G4 (when |V(G)| is even) is strongly IM-extendable; if G is 2-connected, then D2 is ID-factor-critical.     

Cluster synchronization in colored community network with different order node dynamics

In this paper, a colored community network model with different order nodes dynamics is introduced for the first time. The color of nodes or edges are assumed to be identical if they belong to the same community and nonidentical if they belong to different communities. The color of edges between any pair of communities are assumed to be identical if they connect the same pair of communities and nonidentical if they connect different pair of communities. Further, the order of the node dynamics in different communities can be totally different. Firstly, based on the Lyapunov stability theory, adaptive feedback controllers are designed for achieving cluster synchronization. Secondly, periodically intermittent controllers are designed for achieving cluster synchronization and the synchronization conditions are derived by using mathematical induction method and the analysis technique. Finally, several numerical examples are provided to illustrate the effectiveness of the derived theoretical results.     

半连续格上的半基和局部半基

在完备格上引入了半基和局部半基的概念,给出了半基和局部半基的性质及若干等价刻画,证明了一个完备格是半连续格当且仅当它具有半基也当且仅当它每点有局部半基。在此基础上定义了半连续格的权和特征,探讨了半连续格的权和特征与其上赋予半Scott拓扑和半Lawson拓扑时的拓扑空间的权和特征的关系。解决了文献[8](赵彬,刘妮.连续Domain的特征和浓度,陕西师范大学学报,2002,30(2):1~6)中提出的一个问题。     

On Sets of Measurable Operators Convex and Closed in Topology of Convergence in Measure

For a von Neumann algebra with a faithful normal semifinite trace, the properties of operator “intervals” of three types for operators measurable with respect to the trace are investigated. The first two operator intervals are convex and closed in the topology of convergence in measure, while the third operator interval is convex for all nonnegative operators if and only if the von Neumann algebra is Abelian. A sufficient condition for the operator intervals of the second and third types not to be compact in the topology of convergence in measure is found. For the algebra of all linear bounded operators in a Hilbert space, the operator intervals of the second and third types cannot be compact in the norm topology. A nonnegative operator is compact if and only if its operator interval of the first type is compact in the norm topology. New operator inequalities are proved. Applications to Schatten–von Neumann ideals are obtained. Two examples are considered.     

Gorenstein投射、内射和平坦复形

证明了在任意结合环R上,复形C是Gorenstein投射复形当且仅当每个层次的模C~m是Gorenstein投射模,由此给出了复形Gorenstein投射维数的性质刻画.并证明了对于正合复形C,若对于任意投射模Q,函子Hom(-,Q)作用复形C后仍然得到正合复形,则C是Gorenstein投射复形当且仅当对于所有的m∈Z,有Ker(δ_C~m)是Gorenstein投射模.类似地,本文也讨论了关于Gorenstein内射和Gorenstein平坦复形的相应结果.     

单调空间与度量化定理

本文回答了关于MCM空间遗传性的一个问题,讨论了k-MCM空间是k半层空间的条件,得到了一些用g函数刻划的度量化定理.主要结论有:MCM空间是关于Fσ子空间遗传的;在正规空间类中,q空间(ωN空间,k-MCM空间)是关于开Fσ子空间遗传的;如果X是具有Gδ对角线的正则次中紧 k-MCM空间,则X是k半层空间;X是可度量化空间的充要条件是存在X上的g函数满足对X中任意不相交的闭集F与紧集C,都有某个n∈ω,使得(∪x∈F g(n,x))∩(∪y∈C g(n,y))=(?).     

The isomorphism problem for some universal operator algebras

This paper addresses the isomorphism problem for the universal (non-self-adjoint) operator algebras generated by a row contraction subject to homogeneous polynomial relations. We find that two such algebras are isometrically isomorphic if and only if the defining polynomial relations are the same up to a unitary change of variables, and that this happens if and only if the associated subproduct systems are isomorphic. The proof makes use of the complex analytic structure of the character space, together with some recent results on subproduct systems. Restricting attention to commutative operator algebras defined by a radical ideal of relations yields strong resemblances with classical algebraic geometry. These commutative operator algebras turn out to be algebras of analytic functions on algebraic varieties. We prove a projective Nullstellensatz connecting closed ideals and their zero sets. Under some technical assumptions, we find that two such algebras are isomorphic as algebras if and only if they are similar, and we obtain a clear geometrical picture of when this happens. This result is obtained with tools from algebraic geometry, reproducing kernel Hilbert spaces, and some new complex-geometric rigidity results of independent interest. The C^?-envelopes of these algebras are also determined. The Banach-algebraic and the algebraic classification results are shown to hold for the wot-closures of these algebras as well.     

Nouvelles caracterisations des v-anneaux et des anneaux pseudo-frobeniusiens 1

A class of A-modules is socle-fine if for any A-modules M and N in this class, M and N are isomorphic if and only if socle of M and socle of N are isomorphic. A ring A is a left V-ring if and only if the class of indecomposable quasi-injective A-modules with large socle is socle-fine. A ring A is a left V-ring noetherian if and only if the class of quasi-injective /4-modules with large socle is socle-fine. A ring A is Pseudo-Frobenius if and only if A is a left, cogenerator and the class of projective A-modules is socle-fine.     

Burnside algebra of a finite inverse semigroup

The Burnside algebra for a finite inverse semigroup over a field is considered (the analog of the Grothendieck algebra). The conditions for the algebra to be Frobenius are investigated. It is shown that, if all the subgroups in the semigroup are commutative, then its Burnside algebra is Frobenius if and only if the order of any maximal subgroup is not divisible by the square of the field characteristic.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 46, pp. 41–52, 1974.     

From Hermite rings to Sylvester domains

The main result proved here is a new criterion for a ring to be a Sylvester domain, and so to have a universal skew field of fractions inverting all full matrices: An Hermite ring is a Sylvester domain if and only if any product of full matrices (when defined) is full. This is also shown to hold if (and only if) the set of all full matrices is lower multiplicative. The definition of Hermite rings is weakened, but it is shown that in any case infinitely many sentences are needed.

     

Balancedness conditions for exact games

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced. The condition of exact balancedness is identical to the one of balancedness, except that one of the balancing weights may be negative, while for overbalancedness one of the balancing weights is required to be non-positive and no weight is put on the grand coalition. Exact balancedness and overbalancedness are both easy to formulate conditions with a natural game-theoretic interpretation and are shown to be useful in applications. Using exact balancedness we show that exact games are convex for the grand coalition and we provide an alternative proof that the classes of convex and totally exact games coincide. We provide an example of a game that is totally balanced and convex for the grand coalition, but not exact. Finally we relate classes of balanced, totally balanced, convex for the grand coalition, exact, totally exact, and convex games to one another.     

On superperfect noncomparability graphs

The class of superperfect graphs, which was previously studied by A. J. Hoffman, E. L. Johnson, and M. C. Golumbic, is a proper subclass of the class of perfect graphs; further, it properly contains the class of comparability graphs. In his book, Golumbic proves that, for split graphs, G is a comparability graph if and only if G is superperfect. Moreover, the fact that split graphs are exactly those graphs which are both triangulated and cotriangulated motivated Golumbic to ask if it is true or false that, for triangulated (or cotriangulated) graphs, G is a comparability graph if and only if G is superperfect. In the present paper, we determine those members of Gallai's list of minimal noncomparability graphs which are superperfect and, as a consequence, we find that the answer to the above question is “false” for triangulated and “true” for cotriangulated graphs.     

Unretractive and S-unretractive joins and lexicographic products of graphs

Graphs without proper endomorphisms are the subject of this article. It is shown that the join of two graphs has this property if and only if both summands have it, and that the lexicographic product of a complete graph or an odd circuit as first factors has this property if and only if the second factor has it. A somewhat stronger theorem is proved if the lexicographic product has no proper strong endomorphism. The corresponding result for the join is the same as for usual endomorphisms.