The probability of generating a uniserial group
Abstract
Famously, every finite simple group can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate tends to as . More generally, work of Lucchini and Menegazzo (1997) implies that can be generated by a pair of elements whenever has a unique chief series. In this paper, we generalize the theorem of Liebeck and Shalev by proving that if has a unique chief series and the unique simple quotient of is , then the probability that a pair of elements generate tends to as . As a consequence of our main theorem, for any profinite group where the open normal subgroups form a chain, the probability that a pair of elements topologically generate 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