On permutations of order dividing a given integer

DOI10.1007/s10801-007-0056-5zbMath1138.20006arXiv1702.07406OpenAlexW3106058210WikidataQ56987786 ScholiaQ56987786MaRDI QIDQ2458250

Alice C. Niemeyer, Cheryl E. Praeger

Publication date: 31 October 2007

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

orderssymmetric groupscyclespermutation groupsasymptotic estimatesproportions

Mathematics Subject Classification ID

Related Items (4)

Permutations with equal orders ⋮ Identifying long cycles in finite alternating and symmetric groups acting on subsets ⋮ Unnamed Item ⋮ On the frequency of permutations containing a long cycle.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of solutions of the equation \(x^ s=e\) in the symmetric group
• On an equation in permutations
• Über die Anzahl der Lösungen von \(x^n=1\) in der symmetrischen Gruppe \(S_n\)
• On the frequency of permutations containing a long cycle.
• Asymptotic Expansions
• The asymptotics of 𝑒^{𝑃(𝑧)} and the number of elements of each order in 𝑆_{𝑛}
• 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
• On Solutions of x^d = 1 In Symmetric Groups

This page was built for publication: On permutations of order dividing a given integer