Recent results on permutations without short cycles
Robertas Petuchovas

TL;DR
This paper investigates the density of permutations in symmetric groups that lack short cycles, providing new asymptotic formulas for this density using advanced mathematical techniques.
Contribution
It introduces novel asymptotic formulas for the density of permutations without short cycles, expanding understanding in permutation cycle structure analysis.
Findings
Derived new asymptotic formulas for permutation densities
Applied saddle-point method to analyze cycle restrictions
Enhanced mathematical understanding of permutation cycle distributions
Abstract
The density, denoted by , of permutations having no cycles of length less than in a symmetric group is explored. New asymptotic formulas for are obtained using the saddle-point method when and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Bayesian Methods and Mixture Models
