Some refinements of Stanley's shuffle theorem

From MaRDI portal
Publication:6187330




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.









This page was built for publication: Some refinements of Stanley's shuffle theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187330)