On permutations of order dividing a given integer
Preprint
Abstract
We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.
Keywords
All Related Versions
- Version 1, 2017-02-23, ArXiv
- Published version: Journal of Algebraic Combinatorics, 26 (1), 125.
This publication has 6 references indexed in Scilit:
- On the proportion of permutations of order a multiple of the degreeJournal of the London Mathematical Society, 2007
- On the frequency of permutations containing a long cycleJournal of Algebra, 2006
- A black-box group algorithm for recognizing finite symmetric and alternating groups, ITransactions of the American Mathematical Society, 2003
- ON THE NUMBER OF PERMUTATIONS OF SPECIAL FORMMathematics of the USSR-Sbornik, 1976
- On some problems of a statistical group-theory. IIIActa Mathematica Hungarica, 1967
- Handbuch der Lehre von der Verteilung der PrimzahlenMonatshefte für Mathematik, 1911