SearcharxivSearch

arXiv · 2503.23845

On the depth of subgroups of simple groups

Abstract

The depth of a subgroup $H$ of a finite group $G$ is a positive integer defined with respect to the inclusion of the corresponding complex group algebras $\mathbb{C}H \subseteq \mathbb{C}G$. This notion was originally introduced by Boltje, Danz and K\"{u}lshammer in 2011, and it has been the subject of numerous papers in recent years. In this paper, we study the depth of core-free subgroups, which allows us to apply powerful computational and probabilistic techniques that were originally designed for studying bases for permutation groups. We use these methods to prove a wide range of new results on the depth of subgroups of almost simple groups, significantly extending the scope of earlier work in this direction. For example, we establish best possible bounds on the depth of irreducible subgroups of classical groups and primitive subgroups of symmetric groups. And with the exception of a handful of open cases involving the Baby Monster, we calculate the exact depth of every subgroup of every almost simple sporadic group. We also present a number of open problems and conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy C. Burness. 2025-03-31. On the depth of subgroups of simple groups. https://arxiv.org/abs/2503.23845

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