On permutations of order dividing a given integer (Q2458250)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On permutations of order dividing a given integer |
scientific article |
Statements
On permutations of order dividing a given integer (English)
0 references
31 October 2007
0 references
Let \(S_n\) denote the symmetric group on \(n\) letters and let \(P(n,m)\) denote the proportion of permutations \(g\in S_n\) which satisfy \(g^m=1\). In the present paper a detailed asymptotic analysis of \(P(n,m)\) for sufficiently large \(n\), \(m\geq n\) and \(m=O(n)\) is given. The results are relevant for algorithmic applications.
0 references
symmetric groups
0 references
permutation groups
0 references
orders
0 references
cycles
0 references
proportions
0 references
asymptotic estimates
0 references
