A cyclic analogue of Stanley's shuffling theorem

DOI10.37236/11238zbMath1503.05003arXiv2205.03188OpenAlexW4307165855WikidataQ114988520 ScholiaQ114988520MaRDI QIDQ2094891

Dax T. X. Zhang, Kathy Qing Ji

Publication date: 8 November 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.03188

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Elementary theory of partitions (11P81)

Related Items (1)

Some refinements of Stanley's shuffle theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Stable multivariate Eulerian polynomials and generalized Stirling permutations
• Counting descent pairs with prescribed tops and bottoms
• Cyclic Eulerian elements
• Stanley's shuffling theorem revisited
• A general commutative descent algebra
• Cyclic shuffle compatibility
• \(q\)-counting descent pairs with prescribed tops and bottoms
• A Bijective Proof of Stanley's Shuffling Theorem
• Ordered structures and partitions
• Cyclic quasi-symmetric functions

This page was built for publication: A cyclic analogue of Stanley's shuffling theorem