A Note on the Number of Permutations whose Cycle Lengths Are Prime Numbers

From MaRDI portal




Abstract: Let A be a set of natural numbers and let Sn,A be the set of all permutations of [n]=1,2,...,n with cycle lengths belonging to A. For A(n)=Acap[n], the limit ho=limnoinftymidA(n)mid/n (if it esists) is usually called the density of set A. (Here midBmid stands for the cardinality of the set B.) Several studies show that the asymptotic behavior of the cardinality midSn,Amid, as noinfty, depends on the density ho. It turns out that the asumption ho>0 plays an essential role in the asymptotic analysis of midSn,Amid. Kolchin (1999) noticed that there is a lack of studies on classes of permutations satisfying ho=0 and proposed investigations on certain particular cases. In this note, we consider the permutations whose cycle lengths are prime numbers, that is, we assume that A=mathcalP, where mathcalP denotes the set of all primes. From the Prime Number Theorem it follows that ho=0 for this class of permutations. We deduce an asymptotic formula for the summatory function sumklenmidSk,mathcalPmid/k! as noinfty. In our proof we employ the classical Hardy-Littlewood-Karamata Tauberian theorem.














This page was built for publication: A Note on the Number of Permutations whose Cycle Lengths Are Prime Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375030)