A characterization of the finite simple groups with set of indices of their maximal subgroups

We study the problem concerning the influence of indices of maximal subgroups of a simple group on the structure of a group. We obtain a characterization property of all finite simple groups.     

Asymptotics of the transition probabilities of the simple random walk on self-similar graphs

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs . This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals.

For a class of symmetrically self-similar graphs we study the simple random walk on a cell graph , starting at a vertex of the boundary of . It is proved that the expected number of returns to before hitting another vertex in the boundary coincides with the resistance scaling factor.

Using techniques from complex rational iteration and singularity analysis for Green functions, we compute the asymptotic behaviour of the -step transition probabilities of the simple random walk on the whole graph. The results of Grabner and Woess for the Sierpinski graph are generalised to the class of symmetrically self-similar graphs, and at the same time the error term of the asymptotic expression is improved. Finally, we present a criterion for the occurrence of oscillating phenomena of the -step transition probabilities.

     

On the Characterizability of the Automorphism Groups of Sporadic Simple Groups by Their Element Orders

For G a finite group, π _e (G) denotes the set of orders of elements in G. If Ω is a subset of the set of natural numbers, h(Ω) stands for the number of isomorphism classes of finite groups with the same set Ω of element orders. We say that G is k-distinguishable if h(π _e (G)) = k < ∞, otherwise G is called non-distinguishable. Usually, a 1-distinguishable group is called a characterizable group. It is shown that if M is a sporadic simple group different from M ₁₂, M ₂₂, J ₂, He, Suz, M ^c L and O′N, then Aut(M) is characterizable by its element orders. It is also proved that if M is isomorphic to M ₁₂, M ₂₂, He, Suz or O′N, then h(π _e (Aut(M))) ∈¸ {1,∞}.     

Standard Envelopes of Commutative Triple Systems

Under certain constraints on the characteristic of a field , the commutative standard enveloping q-algebra >B of a commutative triple system A over is defined. It is proved that(1) if the algebra B is simple, then the system A is simple;(2) if the system A is simple, then B either is simple or decomposes into the direct sum of two isomorphic simple subalgebras (as of ideals).     

On a kind of integrals of empirical processes concerning insurance risk

This paper proves the strong consistence and the central limit theorems for empirical right tail deviations.     

Lattice tensor products. III - Congruences

G. Grätzer and F. Wehrung introduced the lattice tensor product, A?B, of the lattices Aand B. In Part I of this paper, we showed that for any finite lattice A, we can "coordinatize" A?B, that is, represent A?,B as a subset A of B ^A, and provide an effective criteria to recognize the A-tuples of elements of B that occur in this representation. To show the utility of this coordinatization, we prove, for a finite lattice A and a bounded lattice B, the isomorphism Con A ≌ (Con A)B>, which is a special case of a recent result of G. Grätzer and F. Wehrung and a generalization of a 1981 result of G. Grätzer, H. Lakser, and R.W. Quackenbush.     

The Tracial Topological Rank of C*-Algebras

We introduce the notion of tracial topological rank for C*-algebras.In the commutative case, this notion coincides with the coveringdimension. Inductive limits of C*-algebrasof the form PM_n(C(X))P,where X is a compact metric space with dim X k, and P is aprojection in M_n(C(X)), have tracial topological rank no morethan k. Non-nuclear C*-algebras can have small tracial topologicalrank. It is shown that if A is a simple unital C*-algebra withtracial topological rank k (< ), then

(i) A is quasidiagonal,

(ii) A has stable rank 1,

(iii) A has weakly unperforatedK₀(A),

(iv) A has the following Fundamental Comparabilityof Blackadar:if p, q A are two projections with (p) < (q)for all tracialstates on A, then p q

. 2000 MathematicsSubject Classification: 46L05, 46L35.     

There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t

In 1987, Teirlinckproved that if t and are two integers such that v t(mod(t + 1)!^(2t+1) and v t + 1 >0, then there exists a t - (v, t + 1, (t + 1)!^(2t+1)) design. We prove that if there exists a (t+1)-(v,k,)design and a t-(v-1,k-2, (k-t-1)/(v-k+1))design with t 2, then there exists a t-(v+1,k, (v-t+1)(v-t)/ (v-k+1)(k-t))design. Using this recursive construction, we prove that forany pair (t,n) of integers (t 2and n 0), there exists a simple non trivial t-(v,k,) design having an automorphism groupisomorphic to ⁿ ₂.     

RRF rings which are not LRF

Define a ringA to be RRF (respectively LRF) if every right (respectively left)A-module is residually finite. We determine the necessary and sufficient conditions for a formal triangular matrix ring to be RRF (respectively LRF). Using this we give examples of RRF rings which are not LRF.     

光信息科学与技术专业的建设

就光信息科学与技术专业建设的专业定位、课程设置、学生毕业后的去向等问题发表了个人的看法。介绍了在这方面的一些做法,提供了有关数据,可供同类专业的建设参考。