Some refinements of Stanley's shuffle theorem
From MaRDI portal
Publication:6187330
DOI10.1016/J.JCTA.2023.105830zbMATH Open1530.05007arXiv2203.13543MaRDI QIDQ6187330FDOQ6187330
Authors: Kathy Q. Ji, Dax T. X. Zhang
Publication date: 15 January 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2203.13543
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Netto Inversion Number of a Sequence
- Ordered structures and partitions
- Mahonian pairs
- Permutation statistics and partitions
- Title not available (Why is that?)
- Stanley's shuffling theorem revisited
- A Bijective Proof of Stanley's Shuffling Theorem
- Statistics on wreath products, perfect matchings, and signed words
- Shuffle-compatible permutation statistics
- A bijective proof of a major index theorem of Garsia and Gessel
- Shuffle-compatible permutation statistics. II: The exterior peak set
- Bijective proofs of shuffle compatibility results
- On a conjecture concerning shuffle-compatible permutation statistics
- A cyclic analogue of Stanley's shuffling theorem
- Cyclic shuffle compatibility
Cited In (1)
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)