Recent results on permutations without short cycles
Abstract
The density, denoted by (n,r), of permutations having no cycles of length less than r+1 in a symmetric group Sn is explored. New asymptotic formulas for (n,r) are obtained using the saddle-point method when 5≤ r< n and n∞.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.