A note on the probability of generating alternating or symmetric groups
Luke Morgan, Colva M. Roney-Dougal

TL;DR
This paper refines probability estimates for generating alternating and symmetric groups, providing sharp bounds and implications for the minimal number of generators for their direct products.
Contribution
It offers the sharp lower bound for the probability of generating these groups, improving previous estimates and deriving bounds on the number of factors in their direct products.
Findings
Established the quadratic lower bound in terms of n^{-1}
Provided improved bounds on the number of factors in direct products
Enhanced understanding of generation probabilities for symmetric groups
Abstract
We improve on recent estimates for the probability of generating the alternating and symmetric groups and . In particular we find the sharp lower bound, if the probability is given by a quadratic in . This leads to improved bounds on the largest number such that a direct product of copies of can be generated by two elements.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
