arXiv Analytics

Sign in

arXiv:2201.04181 [math.CO]AbstractReferencesReviewsResources

Conditional Probability of Derangements and Fixed Points

Sam Gutmann, Mark Mixer, Steven Morrow

Published 2022-01-11Version 1

The probability that a random permutation in $S_n$ is a derangement is well known to be $\displaystyle\sum\limits_{j=0}^n (-1)^j \frac{1}{j!}$. In this paper, we consider the conditional probability that the $(k+1)^{st}$ point is fixed, given there are no fixed points in the first $k$ points. We prove that when $n \neq 3$ and $k \neq 1$, this probability is a decreasing function of both $k$ and $n$. Furthermore, it is proved that this conditional probability is well approximated by $\frac{1}{n} - \frac{k}{n^2(n-1)}$. Similar results are also obtained about the more general conditional probability that the $(k+1)^{st}$ point is fixed, given that there are exactly $d$ fixed points in the first $k$ points.

Comments: 16 pages, 2 figures. To be published in Transactions on Combinatorics
Categories: math.CO, math.PR
Subjects: 05A05, 05A19, 60C05
Related articles: Most relevant | Search more
arXiv:1607.08742 [math.CO] (Published 2016-07-29)
Fixed points of 321-avoiding permutations
arXiv:2312.01182 [math.CO] (Published 2023-12-02)
Thresholds for patterns in random permutations
arXiv:1705.04801 [math.CO] (Published 2017-05-13)
Asymptotic distribution of fixed points of pattern-avoiding involutions