On the frequency of permutations containing a long cycle.

DOI10.1016/j.jalgebra.2006.02.026zbMath1109.20002arXivmath/0603554OpenAlexW2013719493WikidataQ56987834 ScholiaQ56987834MaRDI QIDQ2496867

Alice C. Niemeyer, Cheryl E. Praeger

Publication date: 20 July 2006

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0603554

zbMATH Keywords

cyclesconditional probabilitiesfinite alternating groupsfinite symmetric groupsblack-box recognition algorithms

Mathematics Subject Classification ID

Combinatorial probability (60C05) Symmetric groups (20B30) Probabilistic methods in group theory (20P05)

Related Items (3)

On permutations of order dividing a given integer ⋮ On the frequency of permutations containing a long cycle. ⋮ The average number of cycles.

Uses Software

• GAP

Cites Work

• Unnamed Item
• On permutations of order dividing a given integer
• On the frequency of permutations containing a long cycle.
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• On the proportion of permutations of order a multiple of the degree
• On some problems of a statistical group-theory. I
• On some problems of a statistical group-theory. III

This page was built for publication: On the frequency of permutations containing a long cycle.