A note on the probability of generating alternating or symmetric groups.

DOI10.1007/S00013-015-0796-8MaRDI QIDQ501148zbMATH OpenOpenAlexFDO

Authors Luke Morgan, Colva M. Roney-Dougal

Publication date 9 October 2015

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.00854, http://hdl.handle.net/10023/9348

zbMATH Keywords

alternating groupsprobabilityrandom generationrandom pairs of generatorssymmetric groups

Mathematics Subject Classification ID

Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)

Abstract: We improve on recent estimates for the probability of generating the alternating and symmetric groups $mathrmAlt(n)$ and $mathrmSym(n)$. In particular we find the sharp lower bound, if the probability is given by a quadratic in $n^{-1}$. This leads to improved bounds on the largest number $h(mathrmAlt(n))$ such that a direct product of $h(mathrmAlt(n))$ copies of $mathrmAlt(n)$ can be generated by two elements.

Review text

Write \(p(X)\) with \(X=S_n\) or \(A_n\) for the probability that two elements of \(X\) generate a subgroup containing \(A_n\). An asymptotic series for \(p(S_n)\) is given by \textit{J. D. Dixon} [Electron. J. Comb. 12, No. 1, Research paper R56 (2005; Zbl 1086.20045)] and explicit upper and lower bounds to \(p(X)\) have been given by \textit{A. Maróti} and \textit{M. C. Tamburini} [Arch. Math. 96, No. 2, 115-121 (2011; Zbl 1222.20003)]. The present paper gives the following improved bounds: if \(X=S_n\) or \(A_n\) with \(n\geq 5\) then \(0.93n^{-2}<1-n^{-1}-p(X)\leq 8.8n^{-2}\). Equality holds in the upper bound if and only if \(n=6\) and the upper bound can be strengthened to \(7.5n^{-2}\) if \(n\geq 14\). The authors note that this result has implications for Philip Hall's problem [\textit{P. Hall}, Q. J. Math., Oxf. Ser. 7, 134-151 (1936; Zbl 0014.10402)] and the relationship between \(p(S)\) for a finite simple group \(S\) and the indices of maximal subgroups of \(S\) [see \textit{M. W. Liebeck} and \textit{A. Shalev}, J. Algebra 184, No. 1, 31-57 (1996; Zbl 0870.20014)].

Recommendations

• Bounds for the probability of generating the symmetric and alternating groups.
• The probability of generating a permutation group.
• The probability of generating the symmetric group
• The probability of generating the symmetric group
• Asymptotics of generating the symmetric and alternating groups.

Cites work

• Asymptotics of generating the symmetric and alternating groups.
• Bounds for the probability of generating the symmetric and alternating groups.
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• The probability of generating a finite simple group.
• The probability of generating the symmetric group

Cited in

(8)

• A note on growth sequences of alternating groups.
• Probabilistic finiteness properties for profinite groups
• Algorithmic search in group theory
• Application of character estimates to the number of \(\mathrm{T}_2\)-systems of the alternating group
• Asymptotics of generating the symmetric and alternating groups.
• scientific article; zbMATH DE number 5150116 (Why is no real title available?)
• Counting irreducible modules for profinite groups
• Bounds for the probability of generating the symmetric and alternating groups.

This page was built for publication: A note on the probability of generating alternating or symmetric groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501148)