Probabilistic Group Theory and Fuchsian 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.

Let $\mathcal{D}$ be a non-trivial quasi-symmetric $2$-design with two block intersection numbers $x=0$ and $2\leq y\leq10$, and suppose that $G$ is an automorphism group of $\mathcal{D}$. If $G$ is flag-transitive and point-primitive, then it is known that $G$ is either of affine type or almost simple type. In this paper, we show that the socle of $G$ cannot be a finite simple exceptional group of Lie type.

Let w = w(x\,..., Xd) 1 be a nontrivial group word. We show that if G is a sufficiently large finite simple group, then every element g e G can be expressed as a product of three values of w in G. This improves many known results for powers, commutators, as well as a theorem on general words obtained in [19]. The proof relies on probabilistic ideas, algebraic geometry, and character theory. Our methods, which apply the 'zeta function' $g(s) = X^eirrG XO)~s> giye rise to various additional results of independent interest, including applications to conjectures of Ore and Thompson.

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.

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.

Maximal 2-signalizers and centralizers of Sylow 2-subgroups in all finite simple groups are described. Also normalizers are computed for Sylow 2-subgroups in the finite simple groups of exceptional Lie type over a field of odd characteristic.

For a finite group $H$‎, ‎let $cs(H)$ denote the set of non-trivial conjugacy class sizes of $H$ and $OC(H)$ be the set of the order components of $H$‎. ‎In this paper‎, ‎we show that if $S$ is a finite simple group with the disconnected prime graph and $G$ is a finite group such that $cs(S)=cs(G)$‎, ‎then $|S|=|G/Z(G)|$ and $OC(S)=OC(G/Z(G))$‎. ‎In particular‎, ‎we show that for some finite simple group $S$‎, ‎$G cong S times Z(G)$‎.

Let $G$ be a group. An element $g$ is c.d. in $G$ if and only if given any element $h$ of $G$, either it is conjugate to $h$ or there is a homomorphism $\xi$ from $G$ onto a finite group such that $\xi (g)$ is not conjugate to $\xi (h)$. Following A. Mostowski, a group is conjugacy separable or c.s. if and only if every element of the group is c.d. Let $F$ be a Fuchsian group, i.e. let $F$ be presented as \[ F = ({S_1}, \ldots ,{S_n},{a_1}, \ldots ,{a_{2r}},{b_1}, \ldots ,{b_t};S_{{1^1}}^e = \cdots = S_{{n^n}}^e = {S_1} \ldots {S_n}{a_1} \ldots {a_{2r}}a_1^{ - 1} \ldots a_{2r}^{ - 1}{b_1} \ldots {b_t} = 1).\] In this paper, we show that every element of infinite order in $F$ is c.d. and if $t \ne 0$ or $r \ne 0$, $F$ is c.s.

We provide new bounds for the divisibility function of the free group $${\mathbf F}_2$$ and construct short laws for the symmetric groups $${{\mathrm{Sym}}}(n)$$ . The construction is random and relies on the classification of the finite simple groups. We also give bounds on the length of laws for finite simple groups of Lie type.

This paper surveys some results in the area of maximal subgroups of the finite simple groups and their automorphism groups. The first two sections are concerned with maximal subgroups of the alternating and symmetric groups. We outline the Reduction Theorem and discuss the maximality of primitive groups in the corresponding symmetric groups. In the third section we consider the corresponding questions for the classical groups. The next section contains a brief survey of knowledge of the maximal subgroups of the other almost simple groups. Finally, the last section outlines some recent work on primitive permutation groups of special degrees.

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

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.

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.

In [1], Borel discussed discrete arithmetic groups arising from quaternion algebras over number fields with particular reference to arithmetic Kleinian and arithmetic Fuchsian groups. In these cases, he described, in each commensurability class, a class of groups which contains all maximal groups. Developing results on embedding commutative orders of the defining number field into maximal or Eichler orders in the defining quaternion algebra, Chinburg and Friedman [2] stated necessary and sufficient conditions for the existence of torsion in this class of groups in terms of the defining arithmetic data. This was more fully explored in the case of Kleinian groups in [3]. In the case of Fuchsian groups, these results on the existence of torsion were extended to obtain formulas for the number of conjugacy classes of finite cyclic subgroups for each group in this class [8, 9]. In this paper, we examine, across the range of arithmetic Fuchsian groups, how widespread torsion is in maximal Fuchsian groups. Some studies in low genus cases (see e.g. [7, 12]) indicate that 2-torsion is very prevalent. The results obtained here substantiate that but we will also obtain maximal arithmetic Fuchsian groups which are torsion-free. The author is grateful to Alan Reid for conversations on parts of this paper.

Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep result, we introduce a new invariant $\gamma_u(G)$, which we call the uniform domination number of $G$. This is the minimal size of a subset $S$ of conjugate elements such that for each $1 \ne x \in G$, there exists $s \in S$ with $G = \langle x, s \rangle$. (This invariant is closely related to the total domination number of the generating graph of $G$, which explains our choice of terminology.) By the result of Guralnick and Kantor, we have $\gamma_u(G) \leqslant |C|$ for some conjugacy class $C$ of $G$, and the aim of this paper is to determine close to best possible bounds on $\gamma_u(G)$ for each family of simple groups. For example, we will prove that there are infinitely many non-abelian simple groups $G$ with $\gamma_u(G) = 2$. To do this, we develop a probabilistic approach, based on fixed point ratio estimates. We also establish a connection to the theory of bases for permutation groups, which allows us to apply recent results on base sizes for primitive actions of simple groups.