Quasirecognition by prime graph of <Emphasis Type="Italic">L</Emphasis><Subscript>10</Subscript>(2)

Let G be a finite group. The prime graph of G is denoted by Γ(G). The main result we prove is as follows: If G is a finite group such that Γ(G) = Γ(L ₁₀(2)) then G/O ₂(G) is isomorphic to L ₁₀(2). In fact we obtain the first example of a finite group with the connected prime graph which is quasirecognizable by its prime graph. As a consequence of this result we can give a new proof for the fact that the simple group L ₁₀(2) is uniquely determined by the set of its element orders.     

Recognition of the Projective Special Linear Group over GF（3）

Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k finite groups G such that G ≌P. In this paper we will prove that the group Lp（3）, where p 〉 3 is a prime number, is at most 2-recognizable.     

2-Recognizability by prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis><Superscript>2</Superscript>)

Let G be a finite group and let Γ(G) be the prime graph of G. Assume p prime. We determine the finite groups G such that Γ(G) = Γ(PSL(2, p ²)) and prove that if p ≠ 2, 3, 7 is a prime then k(Γ(PSL(2, p ²))) = 2. We infer that if G is a finite group satisfying |G| = |PSL(2, p ²)| and Γ(G) = Γ(PSL(2, p ²)) then G ? PSL(2, p ²). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications are also considered of this result to the problem of recognition of finite groups by element orders.     

Recognition of simple groups U 3(Q) by element orders

An exhaustive solution is given to the recognition-by-spectrum problem for finite, simple, three-dimensional unitary groups. For every such group, the number of non-isomorphic, finite, isospectral groups is determined. In particular, a new counterexample to Problem 13.63 in the Kourovka Notebook is furnished. Supported by RFBR grant No. 05-01-00797, and by SB RAS Young Researchers Support grant No. 29 and Integration Project No. 2006.1.2. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 185–202, March–April, 2006.     

Some designs and codes invariant under the groups <Emphasis Type="Italic">S</Emphasis><Subscript>9</Subscript> and <Emphasis Type="Italic">A</Emphasis><Subscript>8</Subscript>

We examine some designs and binary codes constructed from the primitive permutation representations of the groups PSL ₂(8) and PSL ₂(9). For PSL ₂(8) of degree 36, we construct a design and its code with the automorphism groups PSL ₂(8) and S ₉, respectively. For PSL ₂(8) of degree 36 and PSL ₂(9) of degree 15, we construct some designs and its codes invariant under the groups S ₉ and A ₈, respectively. The weight distribution and the dual of these codes are determined. By considering the action of automorphism groups on some of these codes, we obtain the structure of the stabilizer for every codeword and construct some designs such that S ₉ or A ₈ act primitively on them.      

A characterization of the finite simple group L<Subscript>16</Subscript>(2) by its prime graph

In this paper as the main result we prove that the projective special linear group L ₁₆(2) is uniquely determined by its prime graph. In fact we give a positive answer to an open problem arose in Zavarnitsin (Algebra Logic 43(4), 220–231, 2006) and we obtain a first example of a finite group with connected prime graph which is uniquely determined by its prime graph. This research was in part supported by a grant from IPM (No. 86200023).     

Quasirecognition by prime graph of the simple group <Superscript>2</Superscript><Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

As the main result, we show that if G is a finite group such that Γ(G) = Γ(² F ₄(q)), where q = 2^2m+1 for some m ≧ 1, then G has a unique nonabelian composition factor isomorphic to ² F ₄(q). We also show that if G is a finite group satisfying |G| =|² F ₄(q)| and Γ(G) = Γ(² F ₄(q)), then G ≅ ² F ₄(q). As a consequence of our result we give a new proof for a conjecture of W. Shi and J. Bi for ² F ₄(q). The third author was supported in part by a grant from IPM (No. 87200022).     

从特殊线性群到一般射影线性群的同态的一个性质

设F,K为域,GLn（F）,SLn（F）分别表示F上的n级一般线生群和n级特殊线性群．PGLn（F）,PSLn（F）分别表示F上的n级射影一般线性群和n级射影特殊线性群．φ：SLn（F）→PGLn（K）,n≥3为非平凡同态．本文确定了当K的持征为2时η的—个性质．     

Properties of element orders in covers for L<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>) and U<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

We show that if a finite simple group G, isomorphic to PSL_n(q) or PSU_n(q) where either n ≠ 4 or q is prime or even, acts on a vector space over a field of the defining characteristic of G; then the corresponding semidirect product contains an element whose order is distinct from every element order of G. We infer that the group PSL_n(q), n ≠ 4 or q prime or even, is recognizable by spectrum from its covers thus giving a partial positive answer to Problem 14.60 from the Kourovka Notebook.     

Quasirecognition by prime graph of the simple group <Superscript>2</Superscript><Emphasis Type="Italic">G</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

Let G be a finite group. The main result of this paper is as follows: If G is a finite group, such that Γ(G) = Γ(²G₂(q)), where q = 3²ⁿ⁺¹ for some n ≥ 1, then G has a (unique) nonabelian composition factor isomorphic to ² G ₂(q). We infer that if G is a finite group satisfying |G| = |² G ₂(q)| and Γ(G) = Γ (² G ₂(q)) then G ? = ² G ₂(q). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications of this result are also considered to the problem of recognition by element orders of finite groups.     

A RECOGNITION OF SIMPLE GROUPS PSL（3, q） BY THEIR ELEMENT ORDERS

For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.     

On the prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis>) where <Emphasis Type="Italic">p</Emphasis> > 3 is a prime number

Let G be a finite group. We define the prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph. The third author was supported in part by a grant from IPM (No. 84200024).     

Periodic groups saturated by finite simple groups <Emphasis Type="Italic">U</Emphasis><Subscript>3</Subscript>(2<Superscript>m</Superscript>)

Let {ie166-01} be a set of finite groups. A group G is said to be saturated by the groups in {ie166-02} if every finite subgroup of G is contained in a subgroup isomorphic to a member of {ie166-03}. It is proved that a periodic group G saturated by groups in a set {U₃(2^m) | m = 1, 2, …} is isomorphic to U₃(Q) for some locally finite field Q of characteristic 2; in particular, G is locally finite. __________ Translated from Algebra i Logika, Vol. 47, No. 3, pp. 288–306, May–June, 2008.     

Recognizability of finite simple groups <Emphasis Type="Italic">L</Emphasis><Subscript>4</Subscript>(2<Superscript>m</Superscript>) and <Emphasis Type="Italic">U</Emphasis><Subscript>4</Subscript>(2<Superscript>m</Superscript>) by spectrum

It is proved that finite simple groups L₄(2^m), m ⩾ 2, and U₄(2^m), m ⩾ 2, are, up to isomorphism, recognized by spectra, i.e., sets of their element orders, in the class of finite groups. As a consequence the question on recognizability by spectrum is settled for all finite simple groups without elements of order 8. Supported by RFBR (grant Nos. 05-01-00797 and 06-01-39001), by SB RAS (Complex Integration project No. 1.2), and by the Ministry of Education of China (Project for Retaining Foreign Expert). Supported by NSF of Chongqing (CSTC: 2005BB8096). __________ Translated from Algebra i Logika, Vol. 47, No. 1, pp. 83–93, January–February, 2008.     

A group with <Emphasis Type="Italic">H</Emphasis>-Frobenius element of even order

We settle Question 10.61 in the Kourovka Notebook for the case where the order of an element a is even.Supported by RFBR grant No. 03-01-00356 and by the Krasnoyarsk Science Foundation, project 11F0202C.Translated from Algebra i Logika, Vol. 44, No. 1, pp. 70–80, January–February, 2005.     

Simple 3‐designs of PSL(2, 2n) with block size 7

In this paper, we determine the number of the orbits of 7‐subsets of with a fixed orbit length under the action of PSL(2, 2ⁿ). As a consequence, we determine the distribution of λ for which there exists a simple 3‐(2ⁿ + 1, 7, λ) design with PSL(2, 2ⁿ) as an automorphism group. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 1–17, 2008     

New characterization of <Emphasis Type="Italic">S</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>) by its noncommuting graph

Let G be a nonabelian group, and associate the noncommuting graph ?(G) with G as follows: the vertex set of ?(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. Let S ₄(q) be the projective symplectic simple group, where q is a prime power. We prove that if G is a group with ?(G) ? ?(S ₄(q)) then G ? S ₄(q).     

3‐Spontaneous Emission Error Designs from PSL(2, q) or PGL(2, q)

Quantum jump codes are quantum codes that correct errors caused by quantum jumps. A spontaneous emission error design (SEED) was introduced by Beth et al. in 2003 to construct quantum jump codes. In this paper, we study the existence of 3‐SEEDs from PSL(2, q) or PGL(2, q). By doing this, a large number of 3‐ SEEDs are derived for prime powers q and all .