Abstract
We 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have