scholarly journals Crystals, Semistandard Tableaux and Cyclic Sieving Phenomenon

10.37236/8802 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Young-Tak Oh ◽  
Euiyong Park

In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(\lambda)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if $\lambda$ is a Young diagram with $\ell(\lambda) < n$ and $\gcd( n, |\lambda| )=1$, then the triple $\left( \mathsf{SST}_n(\lambda), \mathsf{C}, q^{- \kappa(\lambda)} s_\lambda(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 show the bicyclic sieving phenomenon given by $\mathsf{c}$ and $\mathsf{pr}^n$ for hook shape.


10.37236/2419 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Stefan Kluge

In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.



2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Svetlana Poznanović

International audience We prove the cyclic sieving phenomenon for non-crossing forests and non-crossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of Alan Guo. Nous prouvons le phénomène de crible cyclique pour les forêts et les graphes sans croisement. Plus précisément, le groupe cyclique agit sur ces graphes naturellement par rotation et nous montrons que la structure d'orbite de cette action est codée par certains polynômes. Nos résultats confirment deux conjectures de Alan Guo.



2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
T. K. Petersen ◽  
L. Serrano

International audience We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, $R(w_0)$ possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on $R(w_0)$. Nous montrons que l'ensemble $R(w_0)$ des expressions réduites pour l'élément le plus long du groupe hyperoctaédral présente le phénomène cyclique de tamisage. Plus précisément, $R(w_0)$ possède une action naturelle cyclique donnée par le déplacement de la première lettre d'un mot vers la fin, et nous montrons que la structure d'orbite de cette action est codée par la fonction génératrice pour l'indice majeur sur $R(w_0)$.



10.37236/339 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
T. Kyle Petersen ◽  
Luis Serrano

We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, $R(w_0)$ possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on $R(w_0)$.



Author(s):  
Sam Hopkins ◽  

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 MacMahon. We extend Rhoades's result by also considering symmetries of plane partitions: specifically, complementation and transposition. The relevant polynomial here is the size generating function for symmetric plane partitions, whose product formula was conjectured by MacMahon and proved by Andrews and Macdonald. Finally, we explain how these symmetry results also apply to the rowmotion operator on plane partitions, which is closely related to promotion.



2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
David B Rush

International audience A combinatorial expression for the coefficient of the Schur function $s_{\lambda}$ in the expansion of the plethysm $p_{n/d}^d \circ s_{\mu}$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $\lambda$ is rectangular. In these cases, the coefficient $\langle p_{n/d}^d \circ s_{\mu}, s_{\lambda} \rangle$ is shown to count, up to sign, the number of fixed points of an $\langle s_{\mu}^n, s_{\lambda} \rangle$-element set under the $d^e$ 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 $\lambda$ is rectangular, the action is a certain power of Schützenberger and Shimozono's <i>jeu-de-taquin</i> promotion.This work extends results of Stembridge and Rhoades linking fixed points of the Schützenberger actions to ribbon tableaux enumeration. The conclusion for the case $n=2$ is equivalent to the domino tableaux rule of Carré and Leclerc for discriminating between the symmetric and antisymmetric parts of the square of a Schur function. Une expression combinatoire pour le coefficient de la fonction de Schur $s_{\lambda}$ dans l’expansion du pléthysme $p_{n/d}^d \circ s_{\mu}$ est donné pour tous $d$ que disent $n$, dans les cas où $n=2$, ou $\lambda$ est rectangulaire. Dans ces cas, le coefficient $\langle p_{n/d}^d \circ s_{\mu}, s_{\lambda} \rangle$ se montre à compter, où l’on ignore le signe, le nombre des point fixés d’un ensemble de $\langle s_{\mu}^n, s_{\lambda} \rangle$ éléments sous la puissance $d^e$ d’une action cyclique de l’ordre $n$. Si $n=2$, l’action est l’involution de Schützenberger sur les tableaux semi-standard de Young (aussi connu sous le nom des évacuations), et si $\lambda$ est rectangulaire, l’action est une certaine puissance de l’avancement jeu-de-taquin de Schützenberger et Shimozono.Ce travail étend les résultats de Stembridge et Rhoades, liant les point fixés des actions de Schützenberger aux tableaux de ruban. Pour le cas $n=2$ , la conclusion est équivalent à la règle des tableaux de dominos de Carré et Leclerc, qui distingue entre les parties symétriques et asymétriques du carré d’une fonction de Schur.



10.37236/8720 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Per Alexandersson ◽  
Svante Linusson ◽  
Samu Potka

We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this $q$-analogue exhibits the cyclic sieving phenomenon under a natural action of the cyclic group. The enumeration and cyclic sieving is generalized to Möbius paths. We also discuss properties of a generalization of cyclic sieving, which we call subset cyclic sieving, and introduce the notion of Lyndon-like cyclic sieving that concerns special recursive properties of combinatorial objects exhibiting the cyclic sieving phenomenon.



10.37236/505 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Steven Pon ◽  
Qiang Wang

(Dual-)promotion and (dual-)evacuation are bijections on $SYT(\lambda)$ for any partition $\lambda$. Let $c^r$ denote the rectangular partition $(c,\ldots,c)$ of height $r$, and let $sc_k$ ($k>2$) denote the staircase partition $(k,k-1,\ldots,1)$. We demonstrate a promotion- and evacuation-preserving embedding of $SYT(sc_k)$ into $SYT(k^{k+1})$. We hope that this result, together with results by Rhoades on rectangular tableaux, can help to demonstrate the cyclic sieving phenomenon of promotion action on $SYT(sc_k)$.



10.37236/9168 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Jennifer Morse ◽  
Jianping Pan ◽  
Wencin Poh ◽  
Anne Schilling

We introduce a type $A$ crystal structure on decreasing factorizations of fully-commu\-tative elements in the 0-Hecke monoid which we call $\star$-crystal. This crystal is a $K$-theoretic generalization of the crystal on decreasing factorizations in the symmetric group of the first and last author. We prove that under the residue map the $\star$-crystal intertwines with the crystal on set-valued tableaux recently introduced by Monical, Pechenik and Scrimshaw. We also define a new insertion from decreasing factorization to pairs of semistandard Young tableaux and prove several properties, such as its relation to the Hecke insertion and the uncrowding algorithm. The new insertion also intertwines with the crystal operators.



2004 ◽  
Vol 108 (1) ◽  
pp. 17-50 ◽  
Author(s):  
V. Reiner ◽  
D. Stanton ◽  
D. White


Sign in / Sign up

Export Citation Format

Share Document