Some Refinements of Stanley's Shuffle Theorem
arXiv:2203.13543
Abstract
We first give a combinatorial proof of Stanley's shuffle theorem by using the insertion lemma of Haglund, Loehr and Remmel. Based on this combinatorial construction, we establish several refinements of Stanley's shuffle theorem.
24 pages