Most permutations power to a cycle of small prime length

S. P. Glasby; Cheryl E. Praeger; W. R. Unger

doi:10.1017/S0013091521000110

Most permutations power to a cycle of small prime length

S. P. Glasby, Cheryl E. Praeger, W. R. Unger

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

17 Downloads (Pure)

Abstract

We prove that most permutations of degree n have some power which is a cycle of prime length approximately log n. Explicitly, we show that for n sufficiently large, the proportion of such elements is at least 1 − 5/log log n with the prime between log n and (log n)^log log ⁿ. The proportion of even permutations with this property is at least 1 − 7/log log n.

Original language	English
Pages (from-to)	234-246
Number of pages	13
Journal	Proceedings of the Edinburgh Mathematical Society
Volume	64
Issue number	2
Early online date	24 May 2021
DOIs	https://doi.org/10.1017/S0013091521000110
Publication status	Published - May 2021

Access to Document

10.1017/S0013091521000110

Glasby, et al., 2021 Most permutations power to a cycleAccepted author manuscript, 313 KBLicence: CC BY-NC-ND

Cite this

@article{a3c9362bf7da406d97f5bf7e1e8a2999,

title = "Most permutations power to a cycle of small prime length",

abstract = "We prove that most permutations of degree n have some power which is a cycle of prime length approximately log n. Explicitly, we show that for n sufficiently large, the proportion of such elements is at least 1 − 5/log log n with the prime between log n and (log n)log log n. The proportion of even permutations with this property is at least 1 − 7/log log n.",

keywords = "Cycles, Density, Length, Permutations, Prime",

author = "Glasby, {S. P.} and Praeger, {Cheryl E.} and Unger, {W. R.}",

year = "2021",

month = may,

doi = "10.1017/S0013091521000110",

language = "English",

volume = "64",

pages = "234--246",

journal = "Proceedings of the Edinburgh Mathematical Society",

issn = "0013-0915",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - Most permutations power to a cycle of small prime length

AU - Glasby, S. P.

AU - Praeger, Cheryl E.

AU - Unger, W. R.

PY - 2021/5

Y1 - 2021/5

N2 - We prove that most permutations of degree n have some power which is a cycle of prime length approximately log n. Explicitly, we show that for n sufficiently large, the proportion of such elements is at least 1 − 5/log log n with the prime between log n and (log n)log log n. The proportion of even permutations with this property is at least 1 − 7/log log n.

AB - We prove that most permutations of degree n have some power which is a cycle of prime length approximately log n. Explicitly, we show that for n sufficiently large, the proportion of such elements is at least 1 − 5/log log n with the prime between log n and (log n)log log n. The proportion of even permutations with this property is at least 1 − 7/log log n.

KW - Cycles

KW - Density

KW - Length

KW - Permutations

KW - Prime

UR - http://www.scopus.com/inward/record.url?scp=85106898402&partnerID=8YFLogxK

U2 - 10.1017/S0013091521000110

DO - 10.1017/S0013091521000110

M3 - Article

AN - SCOPUS:85106898402

SN - 0013-0915

VL - 64

SP - 234

EP - 246

JO - Proceedings of the Edinburgh Mathematical Society

JF - Proceedings of the Edinburgh Mathematical Society

IS - 2

ER -

Most permutations power to a cycle of small prime length

Abstract

Access to Document

Other files and links

Complexity of group algorithms and statistical fingerprints of groups

Cite this

Most permutations power to a cycle of small prime length

Abstract

Access to Document

Other files and links

Projects

Complexity of group algorithms and statistical fingerprints of groups

Cite this