Most permutations power to a cycle of small prime length
From MaRDI portal
Publication:4999886
DOI10.1017/S0013091521000110zbMath1467.05005arXiv1911.12613MaRDI QIDQ4999886
William R. Unger, Cheryl E. Praeger, Stephen P. Glasby
Publication date: 5 July 2021
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.12613
Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distribution of primes (11N05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycle lengths in a permutation are typically Poisson
- The average number of cycles.
- The Magma algebra system. I: The user language
- Permutations with orders coprime to a given integer
- Approximate formulas for some functions of prime numbers
- Zur Theorie der Zerlegung von Permutationen in Zyklen
- The Expected order of a Random Permutation
- Permutations with Restricted Cycle Structure and an Algorithmic Application
- On the field of combinatory analysis
- PRIMITIVE PERMUTATION GROUPS CONTAINING A CYCLE
- On some problems of a statistical group-theory. II
- On random permutations without cycles of some lengths
This page was built for publication: Most permutations power to a cycle of small prime length