Random permutations with cycle lengths in a given finite set

DOI10.1515/DMA.2008.002zbMath1174.60001OpenAlexW2019881480MaRDI QIDQ3184514

Aleksandr N. Timashev

Publication date: 21 October 2009

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2008.002

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (5)

Local probabilities for random permutations without long cycles ⋮ Permutations without long or short cycles ⋮ Limit distributions for Euclidean random permutations ⋮ Random permutations with cycle weights ⋮ A limit theorem for the logarithm of the order of a random A-permutation

Cites Work

• The asymptotics of 𝑒^{𝑃(𝑧)} and the number of elements of each order in 𝑆_{𝑛}
• Asymptotic Methods in Enumeration
• Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
• Limit Theorems for Allocation of Particles over Different Cells with Restrictions to the Size of the Cells
• On Solutions of x^d = 1 In Symmetric Groups

This page was built for publication: Random permutations with cycle lengths in a given finite set