On the composition factors of a group with the same prime graph as B n (5)

Let G be a finite group. The prime graph of G is a graph whose vertex set is the set of prime divisors of |G| and two distinct primes p and q are joined by an edge, whenever G contains an element of order pq. The prime graph of G is denoted by Γ(G). It is proved that some finite groups are uniquely determined by their prime graph. In this paper, we show that if G is a finite group such that Γ(G) = Γ(B _n (5)), where n ? 6, then G has a unique nonabelian composition factor isomorphic to B _n (5) or C _n (5).     

On <Emphasis Type="Italic">r</Emphasis>-recognition by prime graph of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(3) where <Emphasis Type="Italic">p</Emphasis> 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\cong B_p(3)}\) or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then \({G\cong B_3(3), C_3(3), D_4(3)}\), or \({G/O_2(G)\cong {\rm Aut}(^2B_2(8))}\). As a corollary, the main result of the above paper is obtained.     

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.     

Quasirecognition by prime graph of 2 D n (3α) where n = 4m + 1 ≥ 21 and α is odd

Let G be a finite group. The prime graph of G is denoted by Γ(G). In this paper, as the main result, we show that if G is a finite group such that Γ(G) = Γ(² D _n (3^α)), where n = 4m+ 1 and α is odd, then G has a unique non-Abelian composition factor isomorphic to ² D _n (3^α). We also show that if G is a finite group satisfying |G| = |² D _n (3^α)|, and Γ(G) = Γ(² D _n (3^α)), then G ? ² D _n (3^α). As a consequence of our result, we give a new proof for a conjecture of Shi and Bi for ² D _n (3^α). Application of this result to the problem of recognition of finite simple groups by the set of element orders are also considered. Specifically, it is proved that ² D _n (3^α) is quasirecognizable by the spectrum.     

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.     

Recognition by spectrum of simple groups <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(2)

It is proved that, if G is a finite group that has the same set of element orders as the simple group C _p (2) for prime p > 3, then G/O ₂(G) is isomorphic to C _p (2).     

Recognition of simple groups B p (3) by the set of element orders

Let G be a finite group and let ω(G) be the set of its element orders. We prove that if ω(G) = ω(B _p (3)) where p is an odd prime, then G ? B ₃(3) or D ₄(3) for p = 3 and G ? B _p (3) for p > 3.     

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.     

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.     

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.     

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.     

A characterization of finite simple groups by the orders of solvable subgroups

Let G be a finite group and S be a finite simple group. In this paper, we prove that if G and S have the same sets of all orders of solvable subgroups, then G is isomorphic to S, or G and S are isomorphic to Bn(q), Cn(q), where n≥3 and q is odd. This gives a positive answer to the problem put forward by Abe and Iiyori.     

On 9- and 10-decomposable finite groups

A finite group G is called n-decomposable if every proper non-trivial normal subgroup of G is a union of n distinct conjugacy classes of G. In some research papers, the question of finding all positive integer n such that there is an n-decomposable finite group was posed. In this paper, we investigate the structure of 9- and 10-decomposable non-perfect finite groups. We prove that a non-perfect group G is 9-decomposable if and only if G is isomorphic to Aut(PSL(2,32)), Aut(PSL(3,3)), the semi-direct product Z ₃ ∝(Z ₅×Z ₅) or a non-abelian group of order pq, where p and q are primes and p?1=8q, and also, a non-perfect finite group G is 10-decomposable if and only if G is isomorphic to Aut(PSL(2,17)), PSL(2,25):2₃, a split extension of PSL(2,25) by Z ₂ in ATLAS notation (Conway et al., Atlas of Finite Groups, [1985]), Aut(U ₃(3)) or D ₃₈, where D ₃₈ denotes the dihedral group of order 38.     

Thompson’s conjecture for alternating group of degree 22

For a finite group G, it is denoted by N(G) the set of conjugacy class sizes of G. In 1980s, J. G. Thompson posed the following conjecture: if L is a finite nonabelian simple group, G is a finite group with trivial center, and N(G) = N(L), then L and G are isomorphic. In this paper, it is proved that Thompson’s conjecture is true for the alternating group A ₂₂ with connected prime graph.     

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.     

On the finite prime spectrum minimal groups

Let G be a finite group. The set of all prime divisors of the order of G is called the prime spectrum of G and is denoted by π(G). A group G is called prime spectrum minimal if π(G) ≠ π(H) for any proper subgroup H of G. We prove that every prime spectrum minimal group all of whose nonabelian composition factors are isomorphic to the groups from the set {PSL ₂(7), PSL ₂(11), PSL ₅(2)} is generated by two conjugate elements. Thus, we extend the corresponding result for finite groups with Hall maximal subgroups. Moreover, we study the normal structure of a finite prime spectrum minimal group with a nonabelian composition factor whose order is divisible by exactly three different primes.     

Extensions and the Induced Characters of Cyclic p-Groups

For a prime p, we denote by B_n the cyclic group of order pⁿ. Let φ be a faithful irreducible character of B_n, where p is an odd prime. We study the p-group G containing B_n such that the induced character φ^G is also irreducible. The purpose of this article is to determine the subgroup N_G(N_G(B_n)) of G under the hypothesis [N_G(B_n):B_n]⁴ ≦ pⁿ.     

On the Sylow graph of a group and Sylow normalizers

Let G be a finite group and G _p be a Sylow p-subgroup of G for a prime p in π(G), the set of all prime divisors of the order of G. The automiser A _p (G) is defined to be the group N _G (G _p )/G _p C _G (G _p ). We define the Sylow graph Γ _A (G) of the group G, with set of vertices π(G), as follows: Two vertices p, q ∈ π(G) form an edge of Γ _A (G) if either q ∈ π(A _p (G)) or p ∈ π(A _q (G)). The following result is obtained Theorem: Let G be a finite almost simple group. Then the graph Γ _A (G) is connected and has diameter at most 5. We also show how this result can be applied to derive information on the structure of a group from the normalizers of its Sylow subgroups.     

Recognition of the Group O+ 10(2) from Its Spectrum

We prove that if the set of orders of elements of a finite group G coincides with the set of orders of elements of the group D=O₁₀ ⁺(2), then G is isomorphic to D. In other words, O ₁₀ ⁺(2) is recognizable from its spectrum.     

On finite groups for which the lattice of <Emphasis Type="Italic">S</Emphasis>-permutable subgroups is distributive

Let p be a prime and let P be a Sylow p-subgroup of a finite nonabelian group G. Let bcl(G) be the size of the largest conjugacy classes of the group G. We show that if p is an odd prime but not a Mersenne prime or if P does not involve a section isomorphic to the wreath product \({Z_p \wr Z_p}\), then \({|P/O_p(G)| \leq bcl(G)}\).