Random generation with cycle type restrictions
Abstract
We study random generation in the symmetric group when cycle type restrictions are imposed. Given π, π' ∈ Sn, we prove that π and a random conjugate of π' are likely to generate at least An provided only that π and π' have not too many fixed points and not too many 2-cycles. As an application, we investigate the following question: For which positive integers m should we expect two random elements of order m to generate An? Among other things, we give a positive answer for any m having any divisor d in the range 3 ≤ d ≤ o(n1/2).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.