A cyclic analogue of Stanley's shuffling theorem

DOI10.37236/11238MaRDI QIDQ2094891zbMATH OpenOpenAlexWikidataFDO

Authors Dax T. X. Zhang, Kathy Q. Ji

Publication date 8 November 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Abstract: We introduce the cyclic major index of a cycle permutation and give a bivariate analogue of enumerative formula for the cyclic shuffles with a given cyclic descent numbers due to Adin, Gessel, Reiner and Roichman, which can be viewed as a cyclic analogue of Stanley's Shuffle Theorem. This gives an answer to a question of Adin, Gessel, Reiner and Roichman, which has been posed by Domagalski, Liang, Minnich, Sagan, Schmidt and Sietsema again.

Review text

Summary: We introduce the cyclic major index of a cyclic permutation and give a bivariate analogue of the enumerative formula for the cyclic shuffles with a given cyclic descent number due to \textit{R. M. Adin} et al. [Isr. J. Math. 243, No. 1, 437--500 (2021; Zbl 1471.05112)], which can be viewed as a cyclic analogue of Stanley's shuffling theorem. This gives an answer to a question of Adin et al. [loc. cit.], which has been posed by \textit{R. Domagalski} et al. [Sémin. Lothar. Comb. 85, B85d, 11 p. (2021; Zbl 1505.05003)] again.

Recommendations

• Cyclic shuffle compatibility
• Stanley's shuffling theorem revisited
• A Bijective Proof of Stanley's Shuffling Theorem
• A bijective proof of a major index theorem of Garsia and Gessel
• Shuffle-compatible permutation statistics

Cites work

• q-counting descent pairs with prescribed tops and bottoms
• A Bijective Proof of Stanley's Shuffling Theorem
• A general commutative descent algebra
• Counting descent pairs with prescribed tops and bottoms
• Cyclic Eulerian elements
• Cyclic shuffle compatibility
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• Ordered structures and partitions
• Stable multivariate Eulerian polynomials and generalized Stirling permutations
• Stanley's shuffling theorem revisited

Cited in

(5)

• Stanley's shuffling theorem revisited
• Cyclic shuffle compatibility
• A Bijective Proof of Stanley's Shuffling Theorem
• scientific article; zbMATH DE number 3872370 (Why is no real title available?)
• Some refinements of Stanley's shuffle theorem

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

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