The Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently Normal
arXiv:1004.1160
Abstract
We use recurrences (alias difference equations) to prove the longstanding conjecture that the two most important permutation statistics, namely the number of inversions and the major index, are asymptotically joint-independently-normal. We even derive more-precise-than needed asymptotic formulas for the (normalized) mixed moments. This is the fully revised second edition, incorportating the many insightful comments of nine conscientious NON-anonymous referees listed under the authors' names. This article is exclusively published in the on-line journal "Personal Journal of Shalosh B. Ekhad and Doron Zeilberger" and this arxiv.
arXiv comment13 pages, accompanied by a Maple package <A HREF="http://www.math.rutgers.edu/~zeilberg/tokhniot/InvMaj">InvMaj</A>
Cited by in corpus (4)
- Explicit Expressions for the Variance and Higher Moments of the Size of a Simultaneous Core Partition and its Limiting Distribution
- Doron Gepner's Statistics on Words in {1,2,3} is (most probably) Asymptotically Logistic
- Moments of permutation statistics and central limit theorems
- Asymptotic correlations of metrics on the symmetric groups