Refined cyclic sieving on words for the major index statistic

From MaRDI portal
Publication:1663795

DOI10.1016/J.EJC.2018.05.003zbMATH Open1393.05263arXiv1706.08631OpenAlexW2963855932WikidataQ129656245 ScholiaQ129656245MaRDI QIDQ1663795FDOQ1663795

Joshua P. Swanson, Connor Ahlbach

Publication date: 24 August 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action and a polynomial. A key example arises from the length generating function for minimal length coset representatives of a parabolic quotient of a finite Coxeter group. In type A, this result can be phrased in terms of the natural cyclic action on words of fixed content. There is a natural notion of refinement for many CSP's. We formulate and prove a refinement, with respect to the major index statistic, of this CSP on words of fixed content by also fixing the cyclic descent type. The argument presented is completely different from Reiner-Stanton-White's representation-theoretic approach. It is combinatorial and largely, though not entirely, bijective in a sense we make precise with a "universal" sieving statistic on words, "flex". A building block of our argument involves cyclic sieving for shifted subset sums, which also appeared in Reiner-Stanton-White. We give an alternate, largely bijective proof of a refinement of this result by extending some ideas of Wagon-Wilf.


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




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Refined cyclic sieving on words for the major index statistic

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