A Simple Proof that Major Index and Inversions are Equidistributed
Abstract
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
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.