On a balanced property of derangements

zbMATH Open1112.05008arXivmath/0606277MaRDI QIDQ870021FDOQ870021

Authors: Miklós Bóna 

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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$.

Full work available at URL: https://arxiv.org/abs/math/0606277

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The \(r\)-derangement numbers
• On the number of derangements and derangements of prime power order of the affine general linear groups
• Roots of polynomials and the derangement problem
• Some nonequiprobable models of random permutations
• Exceedingly deranging!

zbMATH Keywords

generating polynomialsnumber of cycles

Mathematics Subject Classification ID

Asymptotic enumeration (05A16)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed points and matching points in partitions
• On fixed points of permutations.
• The balanced contributions property for equal contributors
• Fixed points of a random restricted growth sequence
• Real zeros and partitions without singleton blocks

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)