SearcharxivSearch

arXiv · 2008.02558

Shintani descent, simple groups and spread

Abstract

The spread of a group $G$, written $s(G)$, is the largest $k$ such that for any nontrivial elements $x_1, \dots, x_k \in G$ there exists $y \in G$ such that $G = \langle x_i, y \rangle$ for all $i$. Burness, Guralnick and Harper recently classified the finite groups $G$ such that $s(G) > 0$, which involved a reduction to almost simple groups. In this paper, we prove an asymptotic result that determines exactly when $s(G_n) \to \infty$ for a sequence of almost simple groups $(G_n)$. We apply probabilistic and geometric ideas, but the key tool is Shintani descent, a technique from the theory of algebraic groups that provides a bijection, the Shintani map, between conjugacy classes of almost simple groups. We provide a self-contained presentation of a general version of Shintani descent, and we prove that the Shintani map preserves information about maximal overgroups. This is suited to further applications. Indeed, we also use it to study $\mu(G)$, the minimal number of maximal overgroups of an element of $G$. We show that if $G$ is almost simple, then $\mu(G) \leqslant 3$ when $G$ has an alternating or sporadic socle, but in general, unlike when $G$ is simple, $\mu(G)$ can be arbitrarily large.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott Harper. 2020-08-06. Shintani descent, simple groups and spread. https://arxiv.org/abs/2008.02558

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