pith. sign in

arxiv: 1611.02501 · v2 · pith:CYFKKFWMnew · submitted 2016-11-08 · 🧮 math.GR

The Probability of Generating the Symmetric Group

classification 🧮 math.GR
keywords groupcharacterprobabilityproofsymmetricalternatingapproachesbabai
0
0 comments X
read the original abstract

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\to\infty$ 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+\mathcal {O}(n^{-2+\epsilon})$. Our proof is based on character theory and character estimates, including recent work by Schlage-Puchta (2012).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.