Abstract
AbstractFrom the set of all permutations of the degree n with a given number N ≤ n of cycles two permutations are choosed randomly, uniformly and independently. The cycles of each permutation are numbered in some of N! possible ways. We study the coincidence probability of the cycle lengths of permutations for a given numbering. This probability up to a suitably selected renumbering of cycles of the first permutation equals to the probability of similarity of these permutations. The asymptotic estimates of the coincidence probability of the cycle lengths are obtained for five types of relations between N, n → ∞.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.