On a balanced property of derangements

MaRDI QIDQ870021zbMATH OpenFDO

Authors Miklós Bóna

Publication date 12 March 2007

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

Full work available at URL https://arxiv.org/abs/math/0606277, https://eudml.org/doc/127335, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r102.html

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

zbMATH Keywords

generating polynomialsnumber of cycles

Mathematics Subject Classification ID

Asymptotic enumeration (05A16)

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

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!

Cited in

(8)

• On fixed points of permutations.
• Fixed points of a random restricted growth sequence
• Fixed points in compositions and words
• The balanced contributions property for equal contributors
• Fixed points and matching points in partitions
• scientific article; zbMATH DE number 5171545 (Why is no real title available?)
• Real zeros and partitions without singleton blocks
• Roots of polynomials and the derangement problem

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)