Recognition of Finite Simple Groups S 4(q) by Their Element Orders

It is proved that among simple groups $S_4(q)$ in the class of finite groups, only the groups $S_4(3^n)$, where $n$ is an odd number greater than unity, are recognizable by a set of their element orders. It is also shown that simple groups $U_3(9)$, ${^3D}_4(2)$, $G_2(4)$, $S_6(3)$, $F_4(2)$, and ${^2E}_6(2)$ are recognizable, but $L_3(3)$ is not.     

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 subsetof the set of natural numbers,h(Ω) stands for the number of isomorphism classes of finite groups withthe stone set Ω of element orders.We say that G is k-distinguishable if h(π_e(G))=k<∞,otherwiseG is called non-distinguishable.Usually,a 1-distinguishable group is called a characterizable group.Itis shown that if M is a sporadic simple group different from M_(12),M_(22),J_2,He,Suz,M~cL and O'N,then Aut(M) is characterizable by its element orders.It is also proved that if M is isomorphic toM_(12),M_(22),He,Suz or O'N,then h(π_e(Aut(M)))∈{1,∞}.     

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,∞}.     

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.     

The Number of Isomorphism Classes of Finite Groups with Given Element Orders

Let G be a finite group and _e(G) the set of element orders of G. Denote by h( _e(G)) the number of isomorphism classes of finite groups H satisfying _e(H) = _e(G). We prove that if G has at least three prime graph components, then h( _e (G)){1, }.     

Quasirecognition of One Class of Finite Simple Groups by the Set of Element Orders

We prove that a finite group, having the same set of element orders as a finite simple group L and the prime graph with at least three connected components, possesses a (unique) nonabelian composition factor which is isomorphic to L, unless L is isomorphic to the alternating group of degree 6.     

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.     

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.     

Second Maximum Sum of Element Orders of Finite Nilpotent Groups

In [1 Amiri , H. , Jafarian Amiri , S. M. , Isaacs , I. M. ( 2009 ). Sums of element orders in finite groups . Communications in Algebra 37 : 2978 – 2980 .[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]], the authors proved that the maximum sum of element orders on finite groups of the same order occurs in cyclic group. In this paper we obtain the structure of groups having maximum sum of element orders on noncyclic nilpotent group of the same order.     

On Finite Simple Groups with the Set of Element Orders as in a Frobenius Group or a Double Frobenius Group

It is proved that a finite simple group with the set of element orders as in a Frobenius group (a double Frobenius group, respectively) is isomorphic to L₃(3) or U₃(3) (to U₃(3) or S₄(3), respectively).     

On Groups with the Second Largest Value of the Sum of Element Orders

For a finite group G, let ψ(G) denote the sum of element orders of G. It is known that the maximum value of ψ on the set of groups of order n, where n is a positive integer, will occur at the cyclic group ? _n . In this paper, we investigate groups with the second largest value of ψ on the set of groups of the same order.     

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.     

Recognition by spectrum of the groups $$ ^2 D_{2^m + 1} (3) $$

Abstract It is proved that a finite group with the same set of element orders as the simple group is isomorphic to . This work was supported by Russian Foundation for Basic Research (Grant No. 07-01-00148), RFBR-BRFBR (Grant No. 08-01-90006) and RFBR-GFEN (Grant No. 08-01-92200)     

Recognition by spectrum of the groups 2~D_(2m+1)(3)

It is proved that a finite group with the same set of element orders as the simple group 2~D_(2m+1)(3) is isomorphic to 2~D_(2m+1)(3).     

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.     

Recognition by the Set of Element Orders of Symmetric Groups of Degree r and r+1 for Prime r

We prove that the symmetric group S _r of prime degree r17 is recognizable by its element order set. A test for recognizability is obtained for the symmetric group S _r+1 with r17 prime.     

Groups Saturated by a Finite Set of Groups

We study the periodic groups that are saturated by a finite set of finite (nonabelian simple) groups, obtaining some information about the elements of the saturating set.     

Pure quantitative characterization of finite simple groups

Let G be a finite group, and let π _e (G) be the set of all element orders of G. In this short paper we prove that π _e (B _n (q)) ≠ π _e (C _n (q)) for all odd q.      

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.