Asymptotics of generating the symmetric and alternating groups.
From MaRDI portal
Publication:2583656
Summary: The probability that a random pair of elements from the alternating group \(A_n\) generates all of \(A_n\) is shown to have an asymptotic expansion of the form \(1-1/n-1/n^2-4/n^3-23/n^4-171/n^5-\cdots\). This same asymptotic expansion is valid for the probability that a random pair of elements from the symmetric group \(S_n\) generates either \(A_n\) or \(S_n\). Similar results hold for the case of \(r\) generators (\(r>2\)).
Recommendations
Cited in
(17)- Hypermaps and indecomposable permutations
- Indecomposable permutations, hypermaps and labeled Dyck paths
- The probability of generating certain profinite groups by two elements
- A note on growth sequences of alternating groups.
- Subgroups of cyclic groups and values of the Riemann zeta function
- Probabilistic and asymptotic aspects of finite simple groups.
- Asymptotic behaviour of the conjugacy probability of the alternating group.
- The cycle structure of two rows in a random Latin square
- scientific article; zbMATH DE number 4061474 (Why is no real title available?)
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- On some systems of generators of symmetric and alternating groups which allow a simple software implementation
- A note on the probability of generating alternating or symmetric groups.
- Generation of the symmetric group \(S_{n^2}\)
- \(\delta\)-connectivity in random lifts of graphs
- Bounds for the probability of generating the symmetric and alternating groups.
- Dixon's asymptotic without the classification of finite simple groups
- Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
This page was built for publication: Asymptotics of generating the symmetric and alternating groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583656)
