Cycle Type of Random Permutations: a Toolkit

Kevin Ford

doi:10.19086/da.38090

Cycle Type of Random Permutations: a Toolkit

Kevin Ford

Mathematics

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

Abstract

We provide a standard reference for fundamental distributional results about the cycle type of a random permutation σ ∈ S_n, emphasizing methods which are combinatorial or probabilistic in nature and adaptable to other situations. Many of our techniques are borrowed from methods used to prove analogous theorems about the prime factorization of random integers.

Original language	English (US)
Article number	9
Journal	Discrete Analysis
Volume	2022
DOIs	https://doi.org/10.19086/da.38090
State	Published - 2022

Keywords

Cycle type
Random permutations

ASJC Scopus subject areas

Algebra and Number Theory
Geometry and Topology
Discrete Mathematics and Combinatorics

Online availability

10.19086/da.38090

Library availability

Discover UIUC Full Text

Cite this

@article{509ca67350474470a1635254c4e77026,

title = "Cycle Type of Random Permutations: a Toolkit",

abstract = "We provide a standard reference for fundamental distributional results about the cycle type of a random permutation σ ∈ Sn, emphasizing methods which are combinatorial or probabilistic in nature and adaptable to other situations. Many of our techniques are borrowed from methods used to prove analogous theorems about the prime factorization of random integers.",

keywords = "Cycle type, Random permutations",

author = "Kevin Ford",

note = "Publisher Copyright: {\textcopyright} 2022 Kevin Ford",

year = "2022",

doi = "10.19086/da.38090",

language = "English (US)",

volume = "2022",

journal = "Discrete Analysis",

issn = "2397-3129",

publisher = "Alliance of Diamond OA Journals",

}

TY - JOUR

T1 - Cycle Type of Random Permutations

T2 - a Toolkit

AU - Ford, Kevin

PY - 2022

Y1 - 2022

N2 - We provide a standard reference for fundamental distributional results about the cycle type of a random permutation σ ∈ Sn, emphasizing methods which are combinatorial or probabilistic in nature and adaptable to other situations. Many of our techniques are borrowed from methods used to prove analogous theorems about the prime factorization of random integers.

AB - We provide a standard reference for fundamental distributional results about the cycle type of a random permutation σ ∈ Sn, emphasizing methods which are combinatorial or probabilistic in nature and adaptable to other situations. Many of our techniques are borrowed from methods used to prove analogous theorems about the prime factorization of random integers.

KW - Cycle type

KW - Random permutations

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

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

U2 - 10.19086/da.38090

DO - 10.19086/da.38090

M3 - Article

AN - SCOPUS:85138585075

SN - 2397-3129

VL - 2022

JO - Discrete Analysis

JF - Discrete Analysis

M1 - 9

ER -

Cycle Type of Random Permutations: a Toolkit

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this