Subgroups of symmetric groups: enumeration and asymptotic properties

Abstract

In this paper, we prove that the symmetric group Sn has 2n2/16+o(n2) subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of Sn of various kinds, including the number of p-subgroups. In addition, we prove a range of theorems about random subgroups of Sn. In particular, we prove the surprising result that for infinitely many n, the probability that a random subgroup of Sn is nilpotent is bounded away from 1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…