Cycle lengths in a permutation are typically Poisson

zbMATH Open1171.05001MaRDI QIDQ870028FDOQ870028

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• PRIME DIVISORS ARE POISSON DISTRIBUTED
• Random permutations with prime lengths of cycles
• The cycle structure of random permutations
• Random permutations with cycle lengths in a given finite set
• On the distribution of the number of cycles of a given length in the class of permutations with known number of cycles

Mathematics Subject Classification ID

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

Cited In (11)

• Local probabilities and total variation distance for random permutations
• Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
• Title not available (Why is that?)
• On the largest part size of low‐rank combinatorial assemblies
• A Unified Approach to Related-Key Attacks
• Permutations without long or short cycles
• Multiplicative arithmetic functions and the generalized Ewens measure
• Most permutations power to a cycle of small prime length
• A Tale of Three Couplings: Poisson–Dirichlet and GEM Approximations for Random Permutations
• Distribution of cycle lengths of inifinite permutations
• Analytic number theory for 0-cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870028)