Recognition of finite groups by a set of orders of their elements

For G a finite group, ω(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 nonisomorphic groups G such that ω(G)=ω. We say that G is recognizable (by ω(G)) if h(ω(G))=1. G is almost recognizable (resp., nonrecognizable) if h(ω(G)) is finite (resp., infinite). It is shown that almost simple groups PGL_n(q) are nonrecognizable for infinitely many pairs (n, q). It is also proved that a simple group S₄(7) is recognizable, whereas A₁₀, U₃(5), U₃(7), U₄(2), and U₅(2) are not. From this, the following theorem is derived. Let G be a finite simple group such that every prime divisor of its order is at most 11. Then one of the following holds: (i) G is isomorphic to A₅, A₇, A₈, A₉, A₁₁, A₁₂, L₂(q), q=7, 8, 11, 49, L₃(4), S₄(7), U₄(3), U₆(2), M₁₁, M₁₂, M₂₂, HS, or M^cL, and G is recognizable by the set ω(G); (ii) G is isomorphic to A₆, A₁₀, U₃(3), U₄(2), U₅(2), U₃(5), or J₂, and G is nonrecognizable; (iii) G is isomorphic to S₆(2) or O ₈ ⁺ (2), and h(ω(G))=2. Supported by RFFR grant No. 96-01-01893. Translated fromAlgebra i Logika, Vol. 37, No. 6, pp. 651–666, November–December, 1998.     

Conjugate biprimitive finite groups saturated with finite simple subgroupsU 3(2 n )

A group G is saturated with groups of the set X if every finite subgroup K≤G is embedded in G into a subgroup L isomorphic to some group of X. We study periodic conjugate biprimitive finite groups saturated with groups in the set {U₃(2ⁿ)}. It is proved that every such group is isomorphic to a simple group U₃(Q) over a locally finite field Q of characteristic 2. Supported by the RF State Committee of Higher Education. Translated fromAlgebra i Logika, Vol. 37, No. 5, pp. 606–615, September–October, 1998.     

Quasirecognizability by the Set of Element Orders for Groups 3D4(q) and F4(q), for q Odd

It is proved that if L is one of the simple groups ³D₄(q) or F₄(q), where q is odd, and G is a finite group with the set of element orders as in L, then the derived subgroup of G/F(G) is isomorphic to L and the factor group G/G′ is a cyclic {2, 3}-group. __________ Translated from Algebra i Logika, Vol. 44, No. 5, pp. 517–539, September–October, 2005. Supported by RFBR grant No. 04-01-00463.     

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.     

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.     

The Characterization of Finite Simple Groups, L3（3^2m-1）（m≥2）, by Their Element Orders

In this paper the following theorem is proved： Every group L3（q） for q = 3^（2m-1）（m≥2） is characterized by its set of element orders.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

Characterizations of finite groups by sets of orders of their elements

For a finite group G, ω(G) denotes the set of orders of its elements. If ω is a subset of the set of natural numbers, h(ω) stands for the number of pairwise nonisomorphic finite groups G for which ω(G)=ɛ. We prove that h(ω(G))=1, if G is isomorphic to S₉, S₁₁, S₁₂, S₁₃, or A₁₂, and h(ω(G))=2 if G is isomorphic to S₂(6) or to O ₈ ⁺ (2). 01 Supported by RFFR grant No. 96-01-01893. Translated fromAlgebra i Logika, Vol. 36, No. 1, pp. 37–53, January–February, 1997.     

Some infinite groups with strongly embedded subgroup

An involution i of a group G is said to be finite if |ii^g|<∞ for all g ∃ G. Suppose that G contains a finite involution and an infinite elementary Abelian 2-subgroup S and, moreover, the normalizer H=N_G(S)=SλT is strongly embedded in G and is a Frobenius group with locally cyclic complement T. It is proved that G is isomorphic to L₂(Q) over a locally finite field Q of characteristic 2. In particular, part (a) of Question 10.76 raised by Shunkkov in the Kourovka Notebook is answered in the affirmative. Supported by RFFR grant No. 99-01-00542. Translated fromAlgebra i Logika, Vol. 39, No. 5, pp. 602–617, September–October, 2000.     

Quasirecognition by the set of element orders of the groups E 6( q ) and 2 E 6( q )

We prove that if L is one of the simple groups E ₆(q) and ² E ₆(q) and G is some finite group with the same spectrum as L, then the commutant of G/F(G) is isomorphic to L and the quotient G/G′ is a cyclic {2,3}-group. Original Russian Text Copyright ? 2007 Kondrat’ev A. S. The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00463) and the RFBR-NSFC (Grant 05-01-39000). __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 6, pp. 1250–1271, November–December, 2007.     

Recognition by prime graph of $^2 D_{2^m + 1} (3)$

As shown in [1] the simple group ² D_{2^m + 1} (3)^2 D_{2^m + 1} (3) is recognizable by spectrum. The main result of this paper generalizes the above, stating that ² D_{2^m + 1} (3)^2 D_{2^m + 1} (3) is recognizable by prime graph. In other words, we show that if G is a finite group satisfying G(G) = G(² D_{2^m + 1} (3))\Gamma (G) = \Gamma (^2 D_{2^m + 1} (3)) then G @ ² D_{2^m + 1} (3)G \cong ^2 D_{2^m + 1} (3).     

Quasirecognizability by the Set of Element Orders for Groups 3 D 4(q), for q Even

It is proved that if G is a finite group with an element order set as in the simple group ³D₄(q), where q is even, then the commutant of G/F(G) is isomorphic to ³D₄(q) and the factor group G/G′ is a cyclic {2, 3}-group. __________ Translated from Algebra i Logika, Vol. 45, No. 1, pp. 3–19, January–February, 2006.     

2-Cohomologies of the groups SL(n, q)

Let G = SL(n, q), where q is odd, V be a natural module over G, and L = S²(V) be its symmetric square. We construct a 2-cohomology group H²(G, L). The group is one-dimensional over F _q if n = 2 and q ≠ 3, and also if (n, q) = (4, 3). In all other cases H²(G, L) = 0. Previously, such groups H²(G, L) were known for the cases where n = 2 or q = p is prime. We state that H²(G, L) are trivial for n ⩾ 3 and q = p^m, m ⩾ 2. In proofs, use is made of rather elementary (noncohomological) methods. __________ Translated from Algebra i Logika, Vol. 47, No. 6, pp. 687–704, November–December, 2008.     

Normal Cayley graphs of finite groups

LetG be a finite group and let S be a nonempty subset of G not containing the identity element 1. The Cayley (di) graph X = Cay(G, S) of G with respect to S is defined byV (X)=G, E (X)={(g,sg)|g∈G, s∈S} A Cayley (di) graph X = Cay (G,S) is said to be normal ifR(G) ◃A = Aut (X). A group G is said to have a normal Cayley (di) graph if G has a subset S such that the Cayley (di) graph X = Cay (G, S) is normal. It is proved that every finite group G has a normal Cayley graph unlessG≅ℤ₄×ℤ₂ orG≅Q ₈×ℤ ₂ ^r (r⩾0) and that every finite group has a normal Cayley digraph, where Z_m is the cyclic group of orderm and Q₈ is the quaternion group of order 8. Project supported by the National Natural Science Foundation of China (Grant No. 10231060) and the Doctorial Program Foundation of Institutions of Higher Education of China.     

Large nilpotent subgroups of finite simple groups

Orders and the structure of large nilpotent subgroups in all finite simple groups are determined. In particular, it is proved that if G is a finite simple non-Abelian group, and N is some of its nilpotent subgroups, then |N|²<|G|. Supported through FP “Integration” project No. 274, by RFFR grant No. 99-01-00550, by International Soros Education Program for Exact Sciences (ISEP) grant No. S99-56, and by a SO RAN grant for Young Scientists, Presidium Decree No. 83 of 03/10/2000. Translated fromAlgebra i Logika, Vol. 39, No. 5, pp. 526–546, September—October, 2000.     

On r-recognition by prime graph of Bp(3) where p is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then G @ B_p(3){G\cong B_p(3)} or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then G @ B₃(3), C₃(3), D₄(3){G\cong B_3(3), C_3(3), D_4(3)}, or G/O₂(G) @ Aut(²B₂(8)){G/O_2(G)\cong {\rm Aut}(^2B_2(8))}. As a corollary, the main result of the above paper is obtained.     

Groups with an element permuting with finitely many of its conjugates

We study the problem as to which is the cardinality of connected components of the graph Γ_α, defined as follows. Let G be a group and a an element of G. The vertex set V(Γ_α) of the graph is the conjugacy class of elements,Cl _G(a), and two vertices x and y of the graph Γ_α are bridged by an edge iff x=y. If the intersectionC _G(a)∩Cl _G(a) is finite, Γ_α is locally finite. We prove that connected components of the locally finite graph Γ_α are finite in some classes of groups. Supported by RFFR grant No. 94-01-01084. Translated fromAlgebra i Logika, Vol. 35, No. 5, pp. 543–551, September–October, 1996.     

Periodic groups saturated with <Emphasis Type="Italic">L</Emphasis><Subscript>3</Subscript>(2<Superscript>m</Superscript>)

Let be a set of finite groups. A group G is saturated with groups from if every finite subgroup of G is contained in a subgroup isomorphic to some member of . It is proved that a periodic group G saturated with groups from the set {L₃(2^m)|m = 1, 2, …} is isomorphic to L₃(Q), for a locally finite field Q of characteristic 2; in particular, it is locally finite. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 606–626, September–October, 2007.     

Asymptotic growth of averaged Dehn functions for nilpotent groups

It is proved that in any finite representation of any finitely generated nilpotent group of nilpotency class l ⩾ 1, the averaged Dehn function σ(n) is subasymptotic w.r.t. the function n^l+1. As a consequence it is stated that in every finite representation of a free nilpotent group of nilpotency class l of finite rank r ⩾ 2, the Dehn function σ(n) is Gromov subasymptotic. Supported by RFBR grant No. 04-01-00489. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 60–74, January–February, 2007.     

On Recognition by Spectrum of Finite Simple Linear Groups over Fields of Characteristic 2

A finite group G is said to be recognizable by spectrum, i.e., by the set of element orders, if every finite group H having the same spectrum as G is isomorphic to G. We prove that the simple linear groups L _n (2^k) are recognizable by spectrum for n = 2^m ≥ 32.Original Russian Text Copyright © 2005 Vasil’ev A. V. and Grechkoseeva M. A.The authors were supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program “ Development of the Scientific Potential of Higher School” of the Ministry for Education of the Russian Federation (Grant 8294), the Program “Universities of Russia” (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 749–758, July–August, 2005.