SearcharxivSearch

arXiv · 2608.19105

The structure and generation of the second maximal subgroups of the almost simple groups with alternating, classical or sporadic socle

Abstract

Let $G$ be an almost simple group whose socle is an alternating, classical, or sporadic group, and let $H$ be a non-parabolic maximal subgroup of $G$. We prove that any maximal subgroup $M$ of $H$ can be generated by at most $7$ elements, and that this bound is sharp when the socle of $G$ is alternating or classical; this improves the bound of $12$ due to Burness, Liebeck and Shalev. When the socle is sporadic, at most $5$ generators suffice, and this is again best possible. The proof relies upon a detailed structural analysis of $H$ and $M$, especially when $H$ is a subgroup of a wreath product. In particular, we determine the chief factors of $M$ and subsequently bound its number of generators using the theory of crowns. We also correct the classification of maximal subgroups $H$ of almost simple groups requiring more than three generators, established by Lucchini, Marion and Tracey. Their bound of five generators remains valid, but their classification is missing several pairs $(G,H)$, including cases in which $G$ has socle $\mathrm{PSU}_n(q)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patricia Medina Capilla. 2026-08-19. The structure and generation of the second maximal subgroups of the almost simple groups with alternating, classical or sporadic socle. https://arxiv.org/abs/2608.19105

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