We show that Schützenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this action admits the cyclic sieving phenomenon.
We prove a cyclic sieving result for the set of $3 \times k$ packed increasing tableaux with maximum entry $m :=3+k$ under K-promotion. The "curiosity" is that the sieving polynomial arises from the $q$-hook formula for standard tableaux of "toothbrush shape" $(2^3, 1^{k-2})$ with $m+1$ boxes, whereas K-promotion here only has order $m$.
We prove a collection of conjectures of D. White \cite{WComm}, as well as some related conjectures of Abuzzahab-Korson-Li-Meyer \cite{AKLM} and of Reiner and White \cite{ReinerComm}, \cite{WComm}, regarding the cyclic sieving phenomenon of Reiner, Stanton, and White \cite{RSWCSP} as it applies to jeu-de-taquin promotion on rectangular tableaux. To do this, we use Kazhdan-Lusztig theory and a characterization of the dual canonical basis of $\mathbb{C}[x_{11}, ..., x_{nn}]$ due to Skandera \cite{SkanNNDCB}. Afterwards, we extend our results to analyzing the fixed points of a dihedral action on r…
The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of the most impressive instances of the cyclic sieving phenomenon is a theorem of Rhoades asserting that the set of plane partitions in a rectangular box under the action of promotion exhibits cyclic sieving. In Rhoades's result the sieving polynomial is the size generating function for these plane partitions, which has a well-known product formula due to MacMah…
Let $δ=(δ_1,\ldots,δ_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $δ$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if $δ_i=h$ and a vertical strip if $δ_i=v$. We define $δ$-promotion on such tableaux via a modified jeu-de-taquin. The first main result is that $δ$-promotion has period $n$ on rectangular $δ$-semistandard tableaux, generalizing the results of Haiman and Rhoades for standard and semistandard tableaux. The second main result states that the set of rectangular $δ$-semistandard tableau…
We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(λ,μ)$ of shape $λ=(m,n^b)$ and content $μ$, a $(b+2)$-tuple. We prove that $(SSYT(λ,μ),\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}_{λ,μ}(q)$, up to a power of $q$.
We introduce tableau stabilization, a new phenomenon and statistic on Young tableaux based on jeu de taquin. We investigate bounds for tableau stabilization, the shape of stabilized tableaux, and tableau stabilization as a permutation statistic. We apply tableau stabilization to construct the sufficiently large rectangular tableaux fixed by powers of promotion, which were counted by Brendon Rhoades via the cyclic sieving phenomenon
In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(λ)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if $λ$ is a Young diagram with $\ell(λ) < n$ and $\gcd( n, |λ| )=1$, then the triple $\left( \mathsf{SST}_n(λ), \mathsf{C}, q^{- κ(λ)} s_λ(1,q, \ldots, q^{n-1}) \right) $ exhibits the cyclic sieving phenomenon, where $\mathsf{C}$ is the cyclic group generated by $\mathsf{c}$. We further investigate a connection between $\mathsf{c}$ and the promotion $\mathsf{pr}$ and sho…
We construct a large class of examples of the cyclic sieving phenomenon by expoiting the representation theory of semi-simple Lie algebras. Let $M$ be a finite dimensional representation of a semi-simple Lie algebra and let $B$ be the associated Kashiwara crystal. For $r\ge 0$, the triple $(X,c,P)$ which exhibits the cyclic sieving phenomenon is constructed as follows: the set $X$ is the set of isolated vertices in the crystal $\otimes^rB$; the map $c\colon X\rightarrow X$ is a generalisation of promotion acting on standard tableaux of rectangular shape and the polynomial $P$ is the fake degre…
A combinatorial expression for the coefficient of the Schur function $s_λ$ in the expansion of the plethysm $p_{n/d}^d \circ s_μ$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $λ$ is rectangular. In these cases, the coefficient $\langle p_{n/d}^d \circ s_μ, s_λ \rangle$ is shown to count, up to sign, the number of fixed points of an $\langle s_μ^n, s_λ \rangle$-element set under the $d^{\text{th}}$ power of an order-$n$ cyclic action. If $n=2$, the action is the Schützenberger involution on semistandard Young tableaux (also known as evacuation), and, if $λ$ is rectangular, …
Kreweras words are words consisting of n A's, n B's, and n C's in which every prefix has at least as many A's as B's and at least as many A's as C's. Equivalently, a Kreweras word is a linear extension of the poset ${\sf V}\times [n]$. Kreweras words were introduced in 1965 by Kreweras, who gave a remarkable product formula for their enumeration. Subsequently they became a fundamental example in the theory of lattice walks in the quarter plane. We study Schützenberger's promotion operator on the set of Kreweras words. In particular, we show that 3n applications of promotion on a Kreweras word …