Cycle lengths in a permutation are typically Poisson

MaRDI QIDQ870028zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r107.html

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

Mathematics Subject Classification ID

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

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

Cited in

(13)

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