Enriched cycle structures and roots of permutations

Abstract This paper is concerned with a duality between $r$ -regular permutations and $r$ -cycle permutations, and a monotone property due to Bóna-McLennan-White on the probability $p_r(n)$ for a random permutation of $\{1,2,\ldots, n\}$ to have an $r$ th root, where $r$ is a prime. For $r=2$ , the duality relates permutations with odd cycles to permutations with even cycles. For the general case where $r\geq 2$ , we define an $r$ -enriched permutation as a permutation with $r$ -singular cycles coloured by one of the colours $1, 2, \ldots, r-1 $ . In this setup, we discover a bijection between $r$ -regular permutations and enriched $r$ -cycle permutations, which in turn yields a stronger version of an inequality of Bóna-McLennan-White. This leads to a fully combinatorial understanding of the monotone property, thereby answering their question. When $r$ is a prime power $q^l$ , we further show that $p_r(n)$ is monotone. In the case that $n+1 \not\equiv 0 \pmod q$ , the equality $p_r(n)=p_r(n+1)$ has been established by Chernoff.

Authors

Institutions

Publication Details

Journal
Proceedings of the Edinburgh Mathematical Society
Published
2026-01-08
DOI
https://doi.org/10.1017/s0013091525101338
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enriched cycle structures and roots of permutations

E L Wang, William Y.C. Chen
Proceedings of the Edinburgh Mathematical Society
Advanced Combinatorial Mathematics
article

Enriched cycle structures and roots of permutations

E L Wang, William Y.C. Chen
article en

Abstract

Abstract This paper is concerned with a duality between $r$ -regular permutations and $r$ -cycle permutations, and a monotone property due to Bóna-McLennan-White on the probability $p_r(n)$ for a random permutation of $\{1,2,\ldots, n\}$ to have an $r$ th root, where $r$ is a prime. For $r=2$ , the duality relates permutations with odd cycles to permutations with even cycles. For the general case where $r\geq 2$ , we define an $r$ -enriched permutation as a permutation with $r$ -singular cycles coloured by one of the colours $1, 2, \ldots, r-1 $ . In this setup, we discover a bijection between $r$ -regular permutations and enriched $r$ -cycle permutations, which in turn yields a stronger version of an inequality of Bóna-McLennan-White. This leads to a fully combinatorial understanding of the monotone property, thereby answering their question. When $r$ is a prime power $q^l$ , we further show that $p_r(n)$ is monotone. In the case that $n+1 \not\equiv 0 \pmod q$ , the equality $p_r(n)=p_r(n+1)$ has been established by Chernoff.

Proceedings of the Edinburgh Mathematical Society
Tianjin University (CN)
Openalex Percentile: Top 94%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.