A Note on the Number of Permutations whose Cycle Lengths Are Prime Numbers
From MaRDI portal
Abstract: Let be a set of natural numbers and let be the set of all permutations of with cycle lengths belonging to . For , the limit (if it esists) is usually called the density of set . (Here stands for the cardinality of the set .) Several studies show that the asymptotic behavior of the cardinality , as , depends on the density . It turns out that the asumption plays an essential role in the asymptotic analysis of . Kolchin (1999) noticed that there is a lack of studies on classes of permutations satisfying 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 , where denotes the set of all primes. From the Prime Number Theorem it follows that for this class of permutations. We deduce an asymptotic formula for the summatory function as . 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)