The Probability of Generating the Symmetric Group
- 24 Downloads
We consider the probability p(S n ) that a pair of random permutations generates either the alternating group A n or the symmetric group S n . Dixon (1969) proved that p(S n ) approaches 1 as n→∞ and conjectured that p(S n ) = 1 − 1/n+o(1/n). This conjecture was verified by Babai (1989), using the Classification of Finite Simple Groups. We give an elementary proof of this result; specifically we show that p(S n ) = 1 − 1/n+O(n−2+ε). Our proof is based on character theory and character estimates, including recent work by Schlage-Puchta (2012).
Mathematics Subject Classification (2000)20B30 20C15
Unable to display preview. Download preview PDF.
- J. D. Dixon: Asymptotics of generating the symmetric and alternating groups, Electron. J. Combin. 12 (2005), Research Paper #R56.Google Scholar
- S. Eberhard, K. Ford and D. Koukoulopoulos: Permutations contained in transitive subgroups, Discrete Analysis 12 (2016).Google Scholar
- S. Eberhard: The trivial lower bound for the girth of S n, arXiv:1706.09972 (2017).Google Scholar
- R. Petuchovas: Asymptotic analysis of the cyclic structure of permutations, arXiv:1611.02934 (2016), 1–77.Google Scholar
- N. J. A. Sloane: The On-Line Encyclopedia of Integer Sequences, http://oeis.org, Sequence A113869.Google Scholar