Local probabilities for random permutations without long cycles
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.
scientific article; zbMATH DE number 6576604
scientific article