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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3887638 (Why is no real title available?)
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- A Bijective Proof of Stanley's Shuffling Theorem
- A bijective proof of a major index theorem of Garsia and Gessel
- A cyclic analogue of Stanley's shuffling theorem
- Bijective proofs of shuffle compatibility results
- Cyclic shuffle compatibility
- Mahonian pairs
- On a conjecture concerning shuffle-compatible permutation statistics
- On the Netto Inversion Number of a Sequence
- Ordered structures and partitions
- Permutation statistics and partitions
- Shuffle-compatible permutation statistics
- Shuffle-compatible permutation statistics. II: The exterior peak set
- Stanley's shuffling theorem revisited
- Statistics on wreath products, perfect matchings, and signed words
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)