On a balanced property of derangements
From MaRDI portal
(Redirected from On a balanced property of derangements)
Abstract: We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length , counted by their number of cycles. We then use this result to prove that if is the number of cycles of a randomly selected derangement of length , then the probability that is congruent to a given modulo a given converges to . Finally, we generalize our results to -derangements, which are permutations in which each cycle is longer than .
Summary: We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length \(n\), counted by their number of cycles. We then use this result to prove that if \(k\) is the number of cycles of a randomly selected derangement of length \(n\), then the probability that \(k\) is congruent to a given \(r\) modulo a given \(q\) converges to \(1/q\). Finally, we generalize our results to \(a\)-derangements, which are permutations in which each cycle is longer than \(a\).
Recommendations
Cited in
(9)- On fixed points of permutations.
- The balanced contributions property for equal contributors
- Fixed points of a random restricted growth sequence
- Fixed points and matching points in partitions
- Roots of polynomials and the derangement problem
- Real zeros and partitions without singleton blocks
- Conditional probability of derangements and fixed points
- Fixed points in compositions and words
- scientific article; zbMATH DE number 5171545 (Why is no real title available?)
This page was built for publication: On a balanced property of derangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870021)