Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups

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.

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).

By the methods used heretofore for the determination of the automorphisms of certain families of linear groups, for example, the (projective) unimodular, orthogonal, symplectic, and unitary groups (7, 8), it has been necessary to consider the various families separately and to give many case-by-case discussions, especially when the underlying vector space has few elements, even though the final results are very much the same for all of the groups. The purpose of this article is to give a completely uniform treatment of this problem for all the known finite simple linear groups (listed in §2 below). Besides the * ‘classical groups” mentioned above, these include the “exceptional groups,” considered over the complex field by Cartan and over an arbitrary field by Dickson, Chevalley, Hertzig, and the author (3, 4, 5, 6, 10, 15). The automorphisms of the latter groups are given here for the first time.

The set π(G) of all prime divisors of the order of a finite group G is often called its prime spectrum. It is proved that every finite simple nonabelian group G has sections H1, …, Hm of some special form such that π(H1)∪…∪π(Hm) = π(G) and m ≤ 5. Moreover, m ≤ 2 if G is an alternating or classical simple group. In all cases, it is possible to choose the sections Hi so that each of them is a simple nonabelian group, a Frobenius group, or (in one case) a dihedral group. If the above equality holds for a finite group G, then we say that the set {H1,…,Hm} controls the prime spectrum of G. We also study some parameter c(G) of finite groups G related to the notion of control.

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.

Finite simple nonabelian groups G that are not π-closed for some set of primes π but have π-closed maximal subgroups (property (*) for (G, π)) are studied. We give a list L of finite simple groups that contains any group G with the above property (for some π). It is proved that 2 ∉ π for any pair (G, π) with property (*) (Theorem 1). In addition, we specify for any sporadic simple group G from L all sets of primes π such that the pair (G, π) has property (*) (Theorem 2). The proof uses the author’s results on the control of prime spectra of finite simple groups.

The list of known finite simple groups other than the cyclic, alternating, and Mathieu groups consists of the classical groups which are (projective) unimodular, orthogonal, symplectic, and unitary groups, the exceptional groups which are the direct analogues of the exceptional Lie groups, and certain twisted types which are constructed with the aid of Lie theory (see §§3 and 4 below). In this article, it is proved that each of these groups is generated by two of its elements. It is possible that one of the generators can be chosen of order 2, as is the case for the projective unimodular group (1), or even that one of the generators can be chosen as an arbitrary element other than the identity, as is the case for the alternating groups. Either of these results, if true, would quite likely require methods much more detailed than those used here.

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 finite group and let cd (G) be the set of irreducible character degrees of G. The degree graph Δ(G) is the graph whose set of vertices is the set of primes that divide degrees in cd (G), with an edge between p and q if pq divides a for some degree a ∈ cd (G). We determine the graph Δ(G) for the finite simple groups of types A ℓ(q) and 2 A ℓ (q 2), that is, for the simple linear and unitary groups.

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.

We provide the first examples of words in the free group of rank 2 which are not proper powers and for which the corresponding word maps are non-surjective on an infinite family of finite non-abelian simple groups.

In this article, we study 2-(v, k, λ) designs D with λ prime admitting flag-transitive and point-primitive almost simple automorphism groups G with socle T a finite exceptional simple group or a sporadic simple group. If the socle of G is a finite exceptional simple group, then we prove that D is isomorphic to one of two infinite families of 2-designs with point-primitive automorphism groups, one is the Suzuki-Tits ovoid design with parameter set (v, b, r, k, λ) = (q² + 1, q²(q² + 1)/(q − 1), q², q, q − 1), where q − 1 is a Mersenne prime, and the other is newly constructed in this paper and has parameter set (v, b, r, k, λ) = (q³(q³ − 1)/2, (q + 1)(q⁶ − 1), (q + 1)(q³ + 1), q³/2, q + 1), where q + 1 a Fermat prime. If T is a sporadic simple group, then we show that D is isomorphic to a unique design admitting a point-primitive automorphism group with parameter set (v, b, r, k, λ) = (176, 1100, 50, 2), (12, 22, 11, 6, 5) or (22, 77, 21, 6, 5).

The workshop Permutation groups organised by Robert Guralnick (Southern California), Cheryl Praeger (Western Australia), Jan Saxl (Cambridge) and Katrin Tent (Bielefeld) was held August 5th–11th, 2007. The focus was recent developments in permutation group theory and their influence on, and from, group representation theory, algebraic graph theory and other areas of geometry and combinatorics, algebraic geometry, model theory and infinite symmetrical structures. It was well attended with 50 participants. Especially valuable was the program to support young researchers which gave the opportunity for a considerable number of young mathematicians to participate in the workshop. They benefited from the ‘Oberwolfach experience’ and also enlivened and contributed enormously to the success of the meeting. The workshop had a friendly and vibrant atmosphere, aided by the excellent facilities of the Institute. All participants appreciated the beautiful lecture by John G. Thompson entitled ‘The divisor matrix and {\rm SL}(2,\Z) ’. (In fact, this meeting was the first Oberwolfach workshop in over twenty years that Thompson had attended.) There were 26 other talks, and the program featured in each of the first five sessions at least one talk by a student or young researcher at the beginning of their career. This facilitated interaction between younger and more established researchers. The number of talks was restricted to give plenty of time for discussion and cooperation among the participants. Other communications were presented as posters. Highlights of the workshop addressed both fundamental permutation group theory, and also significant outcomes from applying permutation group theory and methods in combinatorics, model theory and other areas. Some topics arose in more than one context, forming new connections. A common feature of many contributions was application of the finite simple group classification, or new results on the structure of simple groups. As examples, we mention two highlights reported by early career participants. The question of base size of permutation actions is of importance in computational group theory as well as in the study of the graph isomorphism problem. Recent research has thrown much light on the base sizes of actions of almost simple groups in particular. Burness reported on the very recent proof of a conjecture of Cameron and Kantor dating from 1993 concerning non-standard permutation actions of almost simple groups: these are all primitive actions apart from actions of alternating and symmetric groups on subsets or partitions, and of classical groups on subspaces or pairs of complementary subspaces. In all the latter families the minimum base size is unbounded as the group order increases. The somewhat surprising conjecture, now proved, is that the minimum base size of non-standard permutation groups is at most 7, with the unique example where this bound is attained being the Mathieu group M_{24} in its natural action on 24 points. Expander graphs play an important role in computer science and combinatorics, and, for example, are significant in modelling and analysing communication networks. In particular, their diameters grow only logarithmically with the numbers of vertices. This property on diameters was proved in 1989 by Babai, Kantor and Lubotzky to hold for suitable Cayley graphs of simple groups: specifically for each finite nonabelian simple group G , they constructed a valency 7 Cayley graph for G with diameter at most a constant times \log(|G|) . Although their graphs were not expanders, they conjectured that there exists an absolute constant k such that all infinite families of simple groups give rise to families of valency k Cayley graphs that are expanders. Kassabov lectured on amazing progress towards proving this conjecture – it is now proved for all simple groups apart from the Suzuki groups. It was a very happy and successful workshop. Indeed, several of the most distinguished participants commented that this was one of the best Oberwolfach meetings they had attended, with plenty of time for collaboration, and outstanding talks. Extended abstracts of the talks mentioned, as well as all the others, are given below (in the order in which they were presented).

The classification of the groups of the title is a natural successor to the classifications of finite simple groups and of locally finite linear simple groups. The statement of the classification is given along with an explanation of the examples. The proof is then discussed.

A finite group G with conjugacy class rX is said to be rX-complementary generated if, given an arbitrary x∈G-1, there is a y ∈ rXsuch that G <ce:glyph name=dbnd6/> (x,y). The rX-complementary generation of the simple groups was first introduced by Woldar in [17] to show that every sporadic simple group can be generated by an arbitrary element and another suitable element. It is conjectured in [5] that every finite simple group can be generated in this way. In this paper we investigate the rX-complementary generation of the first three Janko groups in an attemp to further develop the techniques of finding rX-complementary generation of the finite simple groups. As a consequence, we obtained all the(p,q,r)-generations of the Janko group J 3, where p,q,r are distinct primes.