arXiv Analytics

Sign in

arXiv:2207.05210 [math.CO]AbstractReferencesReviewsResources

A Simple Proof that Major Index and Inversions are Equidistributed

Michael J. Collins

Published 2022-07-11Version 1

We present a short proof of MacMahon's classic result that the number of permutations with $k$ inversions equals the number whose major index (sum of positions at which descents occur) is $k$

Related articles: Most relevant | Search more
arXiv:1707.01200 [math.CO] (Published 2017-07-05)
Major index over descent for pattern-avoiding permutations
arXiv:1906.09018 [math.CO] (Published 2019-06-21)
A note on the distribution of major index for Schröder paths
arXiv:math/0701096 [math.CO] (Published 2007-01-03)
A major index for matchings and set partitions