Subgroups of symmetric groups: enumeration and asymptotic properties
arXiv:2503.05416
Abstract
In this paper, we prove that the symmetric group has subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of of various kinds, including the number of -subgroups. In addition, we prove a range of theorems about random subgroups of . In particular, we prove the surprising result that for infinitely many , the probability that a random subgroup of is nilpotent is bounded away from .