Local probabilities for random permutations without long cycles
type: Item
instance of: scholarly article
title: Local probabilities for random permutations without long cycles
zbMATH Open document ID: 1338.60020
author: Robertas Petuchovas
author: Eugenijus Manstavičius
published in: The Electronic Journal of Combinatorics
publication date: 2016-05-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1501.00136
full work available at URL: v23i1p58
review text: Summary: We explore the probability \(\nu(n,r)\) that a permutation sampled from the symmetric group of order \(n!\) uniformly at random has no cycles of length exceeding \(r\), where \(1\leqslant r\leqslant n\) and \(n\to\infty\). Asymptotic formulas valid in specified regions for the ratio \(n/r\) are obtained using the saddle-point method combined with ideas originated in analytic number theory.
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 60F10
Mathematics Subject Classification ID: 05A16
zbMATH DE Number: 6576604
zbMATH Keywords: symmetric group
zbMATH Keywords: cycle structure
zbMATH Keywords: short cycles
zbMATH Keywords: saddle-point method
MaRDI profile type: MaRDI publication profile
arXiv ID: 1501.00136
cites work: The Turán-Kubilius inequality for integers without large prime factors.
cites work: Involutions and their progenies
cites work: Logarithmic combinatorial structures: A probabilistic approach
cites work: On Recursions Connected With Symmetric Groups I
cites work: Q3549563
cites work: Polynomials over finite fields free from large and small degree irreducible factors
cites work: On the field of combinatory analysis
cites work: Largest component in random combinatorial structures
cites work: Q3615925
cites work: Asymptotic expansions for the coefficients of analytic functions
cites work: A Generalisation of Stirling's Formula.
cites work: Integers without large prime factors
cites work: Q4036529
cites work: Remarks on the semigroup elements free of large prime factors
cites work: Nicolaas Govert de Bruijn, the enchanter of friable integers
cites work: On Solutions of xd = 1 In Symmetric Groups
cites work: Q4314374
cites work: Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
cites work: Asymptotic Expansions for the Coefficients of eP(z)
cites work: Q3123961
cites work: Random permutations with cycle lengths in a given finite set
cites work: Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples
description: scientific article; zbMATH DE number 6576604