Permutations without long or short cycles
From MaRDI portal
Publication:322212
DOI10.1016/j.endm.2015.06.023zbMath1346.05007OpenAlexW2174141469MaRDI QIDQ322212
Robertas Petuchovas, Eugenijus Manstavicius
Publication date: 14 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.023
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Symmetric groups (20B30)
Related Items
Limit theorems for the logarithm of the order of a random \(A\)-mapping, On mean values of multiplicative functions on the symmetric group, The number of cycles in random permutations without long cycles is asymptotically Gaussian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotics of combinatorial structures with large smallest component
- Cycle lengths in a permutation are typically Poisson
- Involutions and their progenies
- The cycle structure of random permutations
- Remarks on the semigroup elements free of large prime factors
- Largest component in random combinatorial structures
- Logarithmic combinatorial structures: A probabilistic approach
- Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples
- Asymptotic expansions for the coefficients of analytic functions
- Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
- Random permutations with cycle lengths in a given finite set
- Polynomials over finite fields free from large and small degree irreducible factors
- On the field of combinatory analysis
- Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
