The inversion statistic in derangements and in other permutations with a prescribed number of fixed points
Ross G. Pinsky

TL;DR
This paper derives exact formulas for the expected number of inversions in permutations with a fixed number of fixed points, revealing how fixed points influence permutation inversion statistics.
Contribution
It provides new exact formulas for the expected inversions conditioned on fixed points, using the Chinese restaurant process for analysis.
Findings
Expected inversions in derangements are slightly higher than in uniform permutations.
Expected inversions decrease as the number of fixed points increases beyond one.
The analysis employs a novel use of the Chinese restaurant process.
Abstract
We study how the inversion statistic is influenced by fixed points in a permutation. %The expected number of inversions in a uniformly random permutation in is . For each , and each , let denote the uniform probability measure on the set of permutations in with exactly fixed points. We obtain an exact formula for the expected number of inversions under the measure as well as for , for , the -probability that the number precedes the number . In particular, up to a super-exponentially small correction as , the expected number of inversions in a random derangement is more than the value that one obtains for a uniformly random general permutation in . On…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Advanced Combinatorial Mathematics · Algorithms and Data Compression
