2000 character limit reached
Cyclic Sieving for a Family of Semistandard Tableaux
Published 27 Feb 2023 in math.CO | (2302.14143v1)
Abstract: We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(\lambda,\mu)$ of shape $\lambda=(m,nb)$ and content $\mu$, a $(b+2)$-tuple. We prove that $(SSYT(\lambda,\mu),\langle \partial{b+2} \rangle, f(q))$ exhibits the cyclic sieving phenomenon, where $\partial$ is the jeu de taquin promotion operator and $f(q)$ is a modified Kostka-Foulkes polynomial $\widetilde{K}_{\lambda,\mu}(q)$, up to a power of $q$.
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.