Promotion and cyclic sieving on families of SSYT

DOI10.4310/ARKIV.2021.V59.N2.A1MaRDI QIDQ824949zbMATH OpenFDO

Authors Per Alexandersson, Ezgi Kantarci Oğuz, Svante Linusson

Publication date 16 December 2021

Published in Arkiv för Matematik (Search for Journal in Brave)

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

zbMATH Keywords

CSP cyclic sieving phenomenon semi-standard Young tableaux

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Combinatorial aspects of groups and algebras (05E16)

Abstract: We examine a few families of semistandard Young tableaux, for which we observe the cyclic sieving phenomenon under promotion. The first family we consider consists of stretched hook shapes, where we use the cocharge generating polynomial as CSP-polynomial. The second family we consider consists of skew shapes, consisting of rectangles. Again, the charge generating polynomial together with promotion exhibits the cyclic sieving phenomenon. This generalizes earlier result by B. Rhoades and later B. Fontaine and J. Kamnitzer. Finally, we consider certain skew ribbons, where promotion behaves in a predictable manner. This result is stated in form of a bicyclic sieving phenomenon. One of the tools we use is a novel method for computing charge of skew semistandard tableaux, in the case when every number in the tableau occur with the same frequency.

Review text

In this well-written paper, the authors show a few instances of cyclic sieving phenomenon on certain families of semi-standard Young tableaux. Given a set \(X\), a cyclic group \(C_n = \langle g \rangle\) of order \(n\), and a polynomial \(f(q)\) that is a \(q\)-enumerator for \(X\), we say that the triple \((X, C_n, f(q))\) exhibits the cyclic sieving phenomenon (CSP) if, for every \(d \in \mathbb{Z}\), the cardinality of the fixed point set \(\{ x \in X \mid g^d x = x \}\) is equal to \(f(\xi_n^d)\), where \(\xi_n\) is an \(n\)-th root of unity. A semi-standard Young tableau is a filling of a Ferrer diagram with positive integers such that rows are weakly increasing left to right and columns are strictly increasing top to bottom (or bottom to top in French notation). For rectangular shapes of size \(n\), the \(\kappa\)-promotion operator on semi-standard Young tableaux has order \(n\), and indeed a cyclic sieving phenomenon arises. For non-rectangular shapes, such operator has very high order, making it unlikely to obtain CSP instances. For hook shapes, however, a certain power of the \(\kappa\)-promotion operator exhibits it anyway. The main result of this paper is to show that some other families of semi-standard Young tableaux exhibit the cyclic sieving phenomenon under the action of \(\kappa\)-promotion (or some power of it). In particular, they show that the CSP holds for stretched hook shapes with the \(q\)-cocharge enumerator and for skew shapes that are union of disjoint rectangles where the \(q\)-enumerator is given by some Kostka-Foulkes polynomial depending on the shape and the content of the tableau. Furthermore, they also show that certain two-row or three-row ribbon standard Young tableaux exhibit a bi-cyclic sieving phenomenon, that is, a generalization of the CSP obtained by replacing the cyclic group with a direct product of two cyclic groups, and the polynomial \(f(q)\) with a bivariate polynomial \(f(q,t)\). For these ribbon tableaux, the polynomial \(f(q,t)\) is a natural \(q,t\)-enumerator of the objects. In this special case, the biCSP implies the existance of a regular CSP for the action of the \(\kappa\)-promotion operator.

Recommendations

Cited in

(15)

This page was built for publication: Promotion and cyclic sieving on families of SSYT

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