A Bijective Proof of a Major Index Theorem of Garsia and Gessel

TL;DR

This paper presents a bijective proof of a theorem by Garsia and Gessel on the generating function of the major index over permutations formed by shuffles of disjoint sequences, linking it to classical permutation statistics.

Contribution

It introduces a new bijective proof of Garsia and Gessel's major index theorem, including a direct algorithmic approach and applications to known permutation statistic results.

Findings

Proves the distribution of major index over shuffles of sequences.

Establishes a bijection between shuffles and partitions.

Provides an alternative bijective proof of equidistribution of major index and inversion number.

Abstract

In this paper we provide a bijective proof of a theorem of Garsia and Gessel describing the generating function of the major index over the set of all permutations of [n]={1,...,n} which are shuffles of given disjoint ordered sequences whose union is [n]. Two special cases are singled out: If the single element j is inserted into any permutation P of the remaining elements of [n], then the theorem states that inserting j into P increases the major index of P by some element of {0,1,...,n-1}, the increase determined uniquely by the index of insertion. We provide a direct proof of this fact using an algorithm which calculates the increase at each index; this in turn leads to a bijective proof of MacMahon's 1916 result on the equidistribution of major index and inversion number over S_n. Using this special case we prove the general case of the theorem by establishing a bijection between shuffles of ordered sequences and a certain set of partitions. In the second special case of interest, Garsia and Gessel's theorem provides a proof of the equidistribution of major index and inversion number over inverse descent classes, a result first proved bijectively by Foata and Schutzenberger in 1978. We provide, based on the method of our first proof, another bijective proof of this result.