Local probabilities for random permutations without long cycles
From MaRDI portal
Publication:276211
zbMath1338.60020arXiv1501.00136MaRDI QIDQ276211
Robertas Petuchovas, Eugenijus Manstavicius
Publication date: 3 May 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.00136
Related Items (5)
Random permutations without macroscopic cycles ⋮ Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ The number of cycles in random permutations without long cycles is asymptotically Gaussian ⋮ Precise asymptotics of longest cycles in random permutations without macroscopic cycles ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nicolaas Govert de Bruijn, the enchanter of friable integers
- Involutions and their progenies
- Integers without large prime factors
- 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
- Random permutations with cycle lengths in a given finite set
- A Generalisation of Stirling's Formula.
- The Turán-Kubilius inequality for integers without large prime factors.
- 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
- Asymptotic Expansions for the Coefficients of eP(z)
- On Recursions Connected With Symmetric Groups I
- On Solutions of xd = 1 In Symmetric Groups
This page was built for publication: Local probabilities for random permutations without long cycles
