English

The probability of generating a uniserial group

Group Theory 2026-01-26 v1

Abstract

Famously, every finite simple group GG can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate GG tends to 11 as G|G| \to \infty. More generally, work of Lucchini and Menegazzo (1997) implies that GG can be generated by a pair of elements whenever GG has a unique chief series. In this paper, we generalize the theorem of Liebeck and Shalev by proving that if GG has a unique chief series and the unique simple quotient of GG is SS, then the probability that a pair of elements generate GG tends to 11 as S|S| \to \infty. As a consequence of our main theorem, for any profinite group GG where the open normal subgroups form a chain, the probability that a pair of elements topologically generate GG is positive. Along the way, we establish results on the maximal subgroup zeta function of groups with a unique minimal normal subgroup.

Cite

@article{arxiv.2601.16650,
  title  = {The probability of generating a uniserial group},
  author = {Scott Harper and Martyn Quick},
  journal= {arXiv preprint arXiv:2601.16650},
  year   = {2026}
}

Comments

26 pages

R2 v1 2026-07-01T09:17:11.479Z