A new characterization of L 2(q) by its noncommuting graph

Let G be a non-abelian group and associate a non-commuting 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. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

Recognition of some simple groups by their noncommuting graphs

Let G be a nonabelian group and associate a 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. Abdollahi et al. (J Algebra 298(2):468–492, 2006) put forward a conjecture called AAM’s Conjecture in as follows: If M is a finite nonabelian simple group and G is a group such that ?(G) ? ?(M), then G ? M. Even though this conjecture is well known to hold for all simple groups with nonconnected prime graphs and the alternating group A ₁₀ [see Darafsheh (Groups with the same non-commuting graph. Discrete Appl Math (2008) doi:10.1016/j.dam.2008.06.010), Wang and Shi (Commun Algebra 36(2):523–528, 2008)], it is still unknown for all simple groups with connected prime graphs except A ₁₀. In the present paper, we prove that this conjecture is also true for the projective special linear simple group L ₄(9). The new method used in this paper also works well in the cases L ₄(4), L ₄(7), U ₄(7), etc.     

Recognition of some simple groups by their noncommuting graphs

Let G be a nonabelian group and associate a 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. Abdollahi et al. (J Algebra 298(2):468–492, 2006) put forward a conjecture called AAM’s Conjecture in as follows: If M is a finite nonabelian simple group and G is a group such that ∇(G) ≅ ∇(M), then G ≅ M. Even though this conjecture is well known to hold for all simple groups with nonconnected prime graphs and the alternating group A ₁₀ [see Darafsheh (Groups with the same non-commuting graph. Discrete Appl Math (2008) doi:), Wang and Shi (Commun Algebra 36(2):523–528, 2008)], it is still unknown for all simple groups with connected prime graphs except A ₁₀. In the present paper, we prove that this conjecture is also true for the projective special linear simple group L ₄(9). The new method used in this paper also works well in the cases L ₄(4), L ₄(7), U ₄(7), etc.     

Quasirecognition by prime graph of finite simple groups L n (2) and U n (2)

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, p?? are joined by an edge if G has an element of order pp??. Let L=L _n (2) or U _n (2), where n?R17. We prove that L is quasirecognizable by prime graph, i.e. if G is a finite group such that ??(G)=??(L), then G has a unique nonabelian composition factor isomorphic to L. As a consequence of our result we give a new proof for the recognition by element orders of L _n (2). Also we conclude that the simple group U _n (2) is quasirecognizable by element orders.     

Recognition of finite groups by the prime graph

We obtain the first example of an infinite series of finite simple groups that are uniquely determined by their prime graph in the class of all finite groups. We also show that there exist almost simple groups for which the number of finite groups with the same prime graph is equal to 2. 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. 4, pp. 390–408, July–August, 2006.     

Almost simple groups with socle ~3D_4(q) act on finite linear spaces

After the classification of flag-transitive linear spaces, attention has now turned to line-transitive linear spaces. Such spaces are first divided into the point-imprimitive and the point-primitive, the first class is usually easy by the theorem of Delandtsheer and Doyen. The primitive ones are now subdivided, according to the O'Nan-Scotte theorem and some further work by Camina, into the socles which are an elementary abelian or non-abelian simple. In this paper, we consider the latter. Namely, T≤G≤Aut(T) and G acts line-transitively on finite linear spaces, where T is a non-abelian simple. We obtain some useful lemmas. In particular, we prove that when T is isomorphic to 3D4(q), then T is line-transitive, where q is a power of the prime p.     

Almost simple groups with socle 3 D 4(q) act on finite linear spaces

After the classification of flag-transitive linear spaces, attention has now turned to line-transitive linear spaces. Such spaces are first divided into the point-imprimitive and the point-primitive, the first class is usually easy by the theorem of Delandtsheer and Doyen. The primitive ones are now subdivided, according to the O’Nan-Scotte theorem and some further work by Camina, into the socles which are an elementary abelian or non-abelian simple. In this paper, we consider the latter. Namely, T ≤ G ≤ Aut(T) and G acts line-transitively on finite linear spaces, where T is a non-abelian simple. We obtain some useful lemmas. In particular, we prove that when T is isomorphic to ³ D ₄(q), then T is line-transitive, where q is a power of the prime p.     

Recognition by spectrum for finite simple groups of Lie type

The goal of this article is to survey new results on the recognition problem. We focus our attention on the methods recently developed in this area. In each section, we formulate related open problems. In the last two sections, we review arithmetical characterization of spectra of finite simple groups and conclude with a list of groups for which the recognition problem was solved within the last three years.      

On recognition of finite simple groups with connected prime graph

The spectrum of a finite group is the set of its element orders. We prove a theorem on the structure of a finite group whose spectrum is equal to the spectrum of a finite nonabelian simple group. The theorem can be applied to solving the problem of recognizability of finite simple groups by spectrum.     

On recognition by spectrum of the simple groups B 3(q), C 3(q), and D 4(q)

The spectrum of a finite group is the set of its element orders. Two groups are isospectral whenever they have the same spectra. We consider the classes of finite groups isospectral to the simple symplectic and orthogonal groups B ₃(q), C ₃(q), and D ₄(q). We prove that in the case of even characteristic and q > 2 these groups can be reconstructed from their spectra up to isomorphisms. In the case of odd characteristic we obtain a restriction on the composition structure of groups of this class.     

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.     

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.