Cycle lengths in a permutation are typically Poisson

zbMath1171.05001MaRDI QIDQ870028

Andrew Granville

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130550

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (8)

Permutations without long or short cycles ⋮ Local probabilities and total variation distance for random permutations ⋮ On the largest part size of low‐rank combinatorial assemblies ⋮ A Unified Approach to Related-Key Attacks ⋮ Analytic number theory for 0-cycles ⋮ Four random permutations conjugated by an adversary generateS_nwith high probability ⋮ Unnamed Item ⋮ Most permutations power to a cycle of small prime length

This page was built for publication: Cycle lengths in a permutation are typically Poisson