SearcharxivSearch

arXiv · 2210.09635

The spread of finite and infinite groups

Abstract

It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is contained in a generating pair. Much more recently, this result has been generalised in three different directions, which form the basis of this survey article. First, we look at some stronger forms of $\frac{3}{2}$-generation that the finite simple groups satisfy, which are described in terms of spread and uniform domination. Next, we discuss the recent classification of the finite $\frac{3}{2}$-generated groups. Finally, we turn our attention to infinite groups, focusing on the recent discovery that the finitely presented simple groups of Thompson are also $\frac{3}{2}$-generated, as are many of their generalisations. Throughout the article we pose open questions in this area, and we highlight connections with other areas of group theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott Harper. 2022-10-18. The spread of finite and infinite groups. https://arxiv.org/abs/2210.09635

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR