Bounded normal generation and invariant automatic continuity

Let G be a finite nonabelian group and associate a disoriented 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. In 1987, J. G. Thompson gave the following conjecture.Thompson's Conjecture If G is a finite group with Z(G) = 1 and M is a nonabelian simple group satisfying N(G) = N(M), then G ≅ M, where N(G) denotes the set of the sizes of the conjugacy classes of G.In 2006, A. Abdollahi, S. Akbari and H. R. Maimani put forward a conjecture in [1] as follows.AAM's Conjecture Let M be a finite nonabelian simple group and G a group such that ∇(G)≅ ∇ (M). Then G ≅ M.Even though both of the two conjectures are known to be true for all finite simple groups with nonconnected prime graphs, it is still unknown for almost all simple groups with connected prime graphs. In the present paper, we prove that the second conjecture is true for the projective special unitary simple group U4(7).

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 A10 [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 A10. In the present paper, we prove that this conjecture is also true for the projective special linear simple group L4(9). The new method used in this paper also works well in the cases L4(4), L4(7), U4(7), etc.

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. In 1987, Professor J. G. Thompson gave the following conjecture. Thompson's Conjecture. If G is a finite group with Z(G) = 1 and M is a nonabelian simple group satisfying N(G) = N(M), then G ≅ M, where N(G):={n ∈ ℕ | G has a conjugacy class of size n}. In 2006, A. Abdollahi, S. Akbari, and H. R. Maimani put forward a conjecture (AAM's conjecture) in Abdollahi et al. (2006) as follows. AAM's Conjecture. Let M be a finite nonabelian simple group and G a group such that ∇(G) ≅ ∇ (M). Then G ≅ M. In this short article we prove that if G is a finite group with ∇(G) ≅ ∇ (A 10), then G ≅ A 10, where A 10 is the alternating group of degree 10.

More Polish full groups

Let G be a nonabelian group. We define the noncommuting graph ∇(G) of G as follows: its vertex set is G\Z(G), the noncentral elements of G, and two distinct vertices x and y of ∇(G) are joined by an edge if and only if x and y do not commute as elements of G, i.e. [x, y] ≠ 1. The finite group L is said to be recognizable by noncommuting graph if, for every finite group G, ∇(G) ≅ ∇ (L) implies G ≅ L. In the present article, it is shown that the noncommuting graph of a group with trivial center can determine its prime graph. From this, the following theorem is derived. If two finite groups with trivial centers have isomorphic noncommuting graphs, then their prime graphs coincide. It is also proved that the projective special unitary groups U4(4), U4(8), U4(9), U4(11), U4(13), U4(16), U4(17) and the projective special linear groups L9(2), L16(2) are recognizable by noncommuting graph.

The noncommuting graph ∇(G) of a non-abelian group G is defined as follows. The vertex set of ∇(G) is G\Z(G) where Z(G) denotes the center of G and two vertices x and y are adjacent if and only if xy ≠ yx. It has been conjectured that if P is a finite non-abelian simple group and G is a group such that ∇(P) ≅ ∇(G), then G ≅ P. In the present paper, our aim is to consider this conjecture in the case of finite almost simple groups. In fact, we characterize the projective general linear group PGL (2, q) (q is a prime power), which is also an almost simple group, by its noncommuting graph.

We survey recent results regarding embeddings of finite simple groups (and their nonsplit central extensions) in complex Lie groups, especially the Lie groups of exceptional type. Introduction Throughout this paper, L will be a finite group. Representation theory for L is usually understood to be the study of group morphisms L → GL(n, k) for distinguished collections of fields k (e.g., all overfields of a fixed field F ) and positive integers n . The topic of this survey is motivated by the question as to what happens if GL ( n ,·) is replaced by another algebraic group G (·). We shall mainly be concerned with the case where L is a finite simple group (that is, a finite nonabelian simple group) or a central extension thereof, and G(k) is a connected simple algebraic group over a field k . A further restriction of our discussion concerns the field k . It will mostly be taken to be the complex numbers, in which case we will mainly study group morphisms from L to the complex Lie group G (ℂ). (See below for some exceptions in §3 and §5.) For G (·) of classical type, the theory for representations L → G (ℂ) differs little from the usual one for GL ( n , ℂ). Indeed, a representation L → GL ( n , ℂ) decomposes into irreducible subrepresentations. The decomposition is well controlled by character theory.

In her book on varieties of groups, Hanna Neumann posed the following problem [13, p. 166]: “Can a variety other than D contain an infinite number of non-isomorphic non-abelian finite simple groups?”The answer to this question does not seem to be known at present. However, in [7], Heineken and Neumann described an algorithm for determining whether or not there are any non-abelian finite simple groups satisfying a given law. They also outlined a way in which their algorithm could be used to show that “only finitely many of the known non-abelian finite simple groups can satisfy a given non-trivial law”; in this paper, we shall follow their suggestions, and prove theTHEOREM. Let g be a set of mutually non-isomorphic non-abelian finite simple groups, each of which is either an alternating group or a group of Lie type, and let g generate a proper subvariety of D. Then y is finite.

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is solvable if, for all conjugacy classes C and D of G consisting of elements of prime power order, there exist x in C and y in D with x and y generating a solvable group. We also prove the following property of finite nonabelian simple groups, which is the key tool for our proof of the solvability criterion: if G is a finite nonabelian simple group, then there exist two prime divisors a and b of |G| such that, for all elements x, y in G with |x|=a and |y|=b, the subgroup generated by x and y is not solvable. Further, using a recent result of Guralnick and Malle, we obtain a similar membership criterion for any family of finite groups closed under forming subgroups, quotients and extensions.

Let $$I_n(G)$$ denote the number of elements of order n in a finite group G. In 1979, Herzog (Proc Am Math Soc 77:313–314, 1979) conjectured that two finite simple groups containing the same number of involutions have the same order. In a 2018 paper (Arch Math 111:349–351, 2018), Zarrin disproved Herzog’s conjecture with a counterexample. Then he conjectured that “if S is a non-abelian simple group and G a group such that $$I_2(G)=I_2(S)$$ and $$I_p(G) =I_p(S)$$ for some odd prime divisor p, then $$|G|=|S|$$ ”. In this paper, we give more counterexamples to Herzog’s conjecture. Moreover, we disprove Zarrin’s conjecture.

In this paper we introduce the conjugate graph [Formula: see text] associated to a nonabelian group G with vertex set G\Z(G) such that two distinct vertices join by an edge if they are conjugate. We show if [Formula: see text], where S is a finite nonabelian simple group which satisfy Thompson's conjecture, then G ≅ S. Further, if central factors of two nonabelian groups H and G are isomorphic and |Z(G)| = |Z(H)|, then H and G have isomorphic conjugate graphs.

Let G be a finite group and cd(G) be the set of all irreducible complex character degrees of G without multiplicities. The aim of this paper is to propose an extension of Huppert’s conjecture from non-Abelian simple groups to almost simple groups of Lie type. Indeed, we conjecture that if H is an almost simple group of Lie type with cd(G)=cd(H), then there exists an Abelian normal subgroup A of G such that G/A≅H. It is furthermore shown that G is not necessarily the direct product of H and A. In view of Huppert’s conjecture, we also show that the converse implication does not necessarily hold for almost simple groups. Finally, in support of this conjecture, we will confirm it for projective general linear and unitary groups of dimension 3.

Simple classical groups of Lie type are determined by their character degrees

Let G be a finite 2-generated non-cyclic group. The spread of G is the largest integer k such that for any nontrivial elements x1,…,xk, there exists y G ∈ G such that G = 〈xi,y〉 for all i. The more restrictive notion of uniform spread, denoted u(G), requires y to be chosen from a fixed conjugacy class of G, and a theorem of Breuer, Guralnick and Kantor states that u(G) ⩾ 2 for every non-abelian finite simple group G. For any group with u(G) ⩾ 1, we define the uniform domination number γu(G) of G to be the minimal size of a subset S of conjugate elements such that for each nontrivial x ∈ G there exists y ∈ S with G = 〈x, y〉 (in this situation, we say that S is a uniform dominating set for G). We introduced the latter notion in a recent paper, where we used probabilistic methods to determine close to best possible bounds on γu(G) for all simple groups G.In this paper we establish several new results on the spread, uniform spread and uniform domination number of finite groups and finite simple groups. For example, we make substantial progress towards a classification of the simple groups G with γu (G) = 2, and we study the associated probability that two randomly chosen conjugate elements form a uniform dominating set for G. We also establish new results concerning the 2-generation of soluble and symmetric groups, and we present several open problems.

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 A22 with connected prime graph.