2000 character limit reached
A Cyclic Analogue of Stanley's Shuffle Theorem
Published 6 May 2022 in math.CO | (2205.03188v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.