Abstract

A natural interpretation of “maj” and “inv” q-counting of multiset permutations in terms of walks on a lattice with multilane highways is presented. This is applied to give a short combinatorial proof of two theorems of MacMahon and to rederive a recent result of Gessel.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call