On random permutations without cycles of some lengths

From MaRDI portal





Consider a random permutation of \(1,2,\dots,N\) (each permutation with probability \(1/N!\)) and its cycles. The probability that there are no cycles with length in a given set \(J\) is studied. By bounding the sum of the reciprocals of the numbers in \(J\), lower estimates of the probability above are obtained.











This page was built for publication: On random permutations without cycles of some lengths

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