Almost all permutations power to a cycle of prime length
Published 6 years agoVersion 2arXiv:1905.08936
Authors
William R. Unger
Categories
math.GR
Abstract
We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.
Almost all permutations power to a cycle of prime length
6 years ago
v2
1 author
Categories
math.GR
Abstract
We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.
Authors
William R. Unger
arXiv ID: 1905.08936
Published May 22, 2019
Click to preview the PDF directly in your browser