Crystals, semistandard tableaux and cyclic sieving phenomenon
Young-Tak Oh, Euiyong Park

TL;DR
This paper establishes a new cyclic sieving phenomenon on semistandard Young tableaux linked to crystal structures, proving specific cases where cyclic actions and promotion generate a bicyclic sieving phenomenon, especially for hook shapes.
Contribution
It introduces a novel cyclic sieving phenomenon on semistandard Young tableaux derived from crystal structures and explores its connection with promotion, including a bicyclic sieving result for hook shapes.
Findings
Proves cyclic sieving for certain Young tableaux with gcd condition.
Connects cyclic action with promotion in tableaux.
Demonstrates bicyclic sieving for hook shapes.
Abstract
In this paper, we study a new cyclic sieving phenomenon on the set of semistandard Young tableaux with the cyclic action arising from its -crystal structure. We prove that if is a Young diagram with and , then the triple exhibits the cyclic sieving phenomenon, where is the cyclic group generated by . We further investigate a connection between and the promotion and show the bicyclic sieving phenomenon given by and for hook shape.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Crystals, semistandard tableaux and cyclic sieving phenomenon
Young-Tak Oh
Department of Mathematics, Sogang University, Seoul 121-742, Republic of Korea & Korea Institute for Advanced Study, Seoul 02455, Republic of Korea
and
Euiyong Park
Department of Mathematics, University of Seoul, Seoul 02504, Republic of Korea & Korea Institute for Advanced Study, Seoul 02455, Republic of Korea
Abstract.
In this paper, we study a new cyclic sieving phenomenon on the set of semistandard Young tableaux with the cyclic action arising from its -crystal structure. We prove that if is a Young diagram with and , then the triple exhibits the cyclic sieving phenomenon, where is the cyclic group generated by . We further investigate a connection between and the promotion and show the bicyclic sieving phenomenon given by and for hook shape.
Key words and phrases:
crystals, semistandard tableaux, cyclic sieving phenomenon, promotion
2010 Mathematics Subject Classification:
05E18, 05E05, 05E10
The research of Y.-T. Oh was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korean Government (NRF-2018R1D1A1B07051048).
The research of E. Park was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korean Government (NRF-2017R1A1A1A05001058).
Introduction
The cyclic sieving phenomenon was introduced in 2004 by Reiner-Stanton-White in [14]. Let be a finite set, with an action of a cyclic group of order , and a polynomial in with nonnegative integer coefficients. For , let be a th primitive root of the unity. We say that exhibits the cyclic sieving phenomenon if, for all , we have
[TABLE]
where is the order of and is the fixed point set under the action of . Note that this condition is equivalent to the following:
[TABLE]
where counts the number of -orbits on for which the stablilizer-order divides . It has since then been extensively investigated for various combinatorial objects with an action of a finite cyclic group including words, multisets, permutations, non-crossing partitions, lattice paths, tableaux (see [16] for details).
In [17, 18], Schuzenberger introduced the promotion operator on (semi)standard Young tableaux, which takes one (semi)standard Young tableau to another via jeu de taquin slides. Afterwards, it has been studied widely and now has become one of the important objects in various research areas (see [19]). It is known that it has a finite order, but in the best knowledge of the authors, its order is still mysterious except a few cases such as rectangular or staircase Young diagrams [5, 13].
Given a Young diagram , let be the set of semistandard Young tableaux of shape with entries in . In [15], Rhoades proved representation-theoretically that if is of rectangular shape, the triple
[TABLE]
exhibits the cyclic sieving phenomenon, where is the statistic on given by , and is the principal specialization of the Schur polynomial . This result, however, is no longer valid outside rectangular shape in general, which says that, for a non-rectangular shape, another appropriate operator other than should be considered if we stick to the principal specialization on . In [4], Rhoades’ result is refined in the following manner. Let and be a composition of , such that is invariant under th cyclic shift, then the triple
[TABLE]
exhibits the cyclic sieving phenomenon, where is a Kostka-Foulkes polynomial associated with and . Unfortunately, outside rectangular case, no results similar to this seem to be known yet.
In the present paper, we investigate the cyclic sieving phenomenon on with a cyclic action arising from its crystal structure (see Section 1 for crystals). For this purpose, we first notice that , where is the th Bender–Knuth involution acting on . In general, ’s do not satisfy braid relations. We then note that has a -crystal structure, thus it is equipped with an action of the Weyl group. Hence it would be very natural to consider the operator on , where are simple reflections in the Weyl group. The operator shares several similarities with , for instance, it is easy to check that . One of the most favorable features of , compared with , might be that its order is given by for arbitrary shape whereas the order of is very difficult to compute.
In the viewpoint of crystal theory, by using the operator instead of , we observe a new cyclic sieving phenomenon on beyond rectangular shape. More precisely, we prove that if is a Young diagram with and , then the triple
[TABLE]
exhibits the cyclic sieving phenomenon, where is the cyclic group generated by (see Theorem 3.3). There are several examples for which our cyclic sieving phenomenon hold without the condition , and Remark 3.4 shows an example for another cyclic sieving phenomenon with a specialization of other than the principal specialization. It would be an interesting problem to give a characterization of Young diagrams such that exhibits a cyclic sieving phenomenon, where is a suitable specialization of (multiplied by a -power). We also remark that the cyclic sieving phenomenon on the set of isolated vertices of a tensor product of a crystal with a different cyclic operator was studied in [20].
Next, we turn to the connection between and the . For an -tuple , let . We denote by the set of all contents of where varies over , and by the set of all such that . Notice that is invariant under for any . For clarity, denote by the restriction of to .
We here deal with the case where is of hook shape or two-column shape. In these special cases, we show that commutes with ’s, thus commutes with . We then show that the order of on equals , where denotes the order of and the least common multiple of . We next consider the bicyclic sieving phenomenon on in case where is of hook shape with (see [16, Section 9] for the definition). Let with , and consider the polynomial
[TABLE]
given in Theorem 4.10. Here is the monomial symmetric polynomial assocoated to , and is the Kostka-Foulkes polynomial associated with and . Note that the evaluation at is equal to . We show that the triple exhibits the bicyclic sieving phenomenon, where is the cyclic group generated by (see Theorem 4.10).
This paper is organized as follows: In Section 1, we review briefly the crystal theory. In Section 2, we recall the combinatorics of Young tableaux. In Section 3, we study the action of on and prove the triple exhibits the cyclic sieving phenomenon. In Section 4, we investigate a connection between and and show the bicyclic sieving phenomenon given by and for hook shape.
1. Crystals
Let be a finite index set. A square matrix is called a generalized Cartan matrix if it satisfies (i) for and for , (ii) if and only if , (iii) there exists a diagonal matrix such that is symmetric. A Cartan datum consists of
- (1)
a generalized Cartan matrix , 2. (2)
a free abelian group , called the weight lattice, 3. (3)
, called the set of simple roots, 4. (4)
, called the coweight lattice, 5. (5)
, called the set of simple coroots,
which satisfy
- (1)
for , 2. (2)
is linearly independent over , 3. (3)
for each , there exists , called the fundamental weight, such that for all .
We set , called the root lattice, and . We fix a nondegenerate symmetric bilinear form on satisfying
[TABLE]
Let us denote by the set of dominant integral weights, and define for . Let be the Weyl group associated with , which is generated by
[TABLE]
Let be the quantum group associated with the Cartan datum , which is generated by , and with certain defining relations (see [6, Chater 3] for details). The notion of crystals was introduced in [7, 8, 9]. We refer the reader to [3, 6] for details.
Definition 1.1**.**
A crystal associated with is a set together with the maps , , and () satisfying the following properties:
- (1)
for all , 2. (2)
if , 3. (3)
if , 4. (4)
, if , 5. (5)
, if , 6. (6)
if and only if for and , 7. (7)
if for , then .
For a crystal , we set so that . Let
[TABLE]
For a dominant integral weight , we denote by the crystal of the irreducible highest weight -module with highest weight . For , we define the bijection on by
[TABLE]
Then the Weyl group acts on the crystal in which the simple reflection acts via for (see [3, Chapter 2.5] for details). Note that
[TABLE]
The character of is defined by
[TABLE]
where is the number of elements of , and are formal basis elements of the group algebra with the multiplication given by . The -dimension of is given by
[TABLE]
where is the map defined as follows:
[TABLE]
We now assume that and the Cartan matrix is of finite type. Note that the crystal is a finite set. We define the bijection on as follows:
[TABLE]
Since ’s act on as simple reflections of the Weyl group , can be viewed as a Coxeter element of . Let be the cyclic subgroup of generated by , and the Coxeter number of .
Lemma 1.2**.**
The cyclic group has order and acts on the crystal .
2. Semistandard tableaux
For a partition , the length of is defined to be the number of positive parts of and the size of the sum of all parts, that is, and . Throughout this paper, we will confuse with its Young diagram drawn in English convention, more precisely, an array of boxes in which the th row has boxes from top to bottom. The conjugate of denotes the Young diagram obtained from by flipping the diagonal.
A semistandard tableau of shape with entries bounded by is a filling of boxes of with entries in such that
- (1)
the entries in each row are weakly increasing from left to right, and 2. (2)
the entries in each column are strictly increasing from top to bottom.
Let denote the shape of a semistandard tableau and the set of all semistandard tableaux of shape with entries bounded by . We say that if is a box of at the th row and the th column, and denote by the entry of the box . For example, the following is a semistandard tableau of shape with entries bounded by :
[TABLE]
For , the content of is defined to be the -tuple , where is the number of occurrences of in . Setting , we define the Schur polynomial
[TABLE]
Next, we describe the promotion operator on . Let . If does not contain entries equal to , then is defined to be the tableau obtained from by increasing all the entries by 1. Otherwise, replace every entry equal to with a dot, then by using jeu-de-taquin, slide the dots to the northwest corner from left to right and top to bottom. Finally, replace all dots by 1’s and increase all other entries by 1 to obtain .
Example 2.1**.**
Let and . The following is an illustration of the promotion on a tableaux .
[TABLE]
From now on, we assume that the Cartan matrix is of type , i.e., , with . For , we set to be the unit vector with the 1 in the th position. For , we set
[TABLE]
Then we identify the weight lattice with the -dimensional subspace of orthogonal to the vector . Note that the bilinear form corresponds to the usual inner product and for , where the subscript denotes the simple transposition in the symmetric group .
Let be a Young diagram with . Letting , we set It is well-known that admits a -crystal structure and
[TABLE]
as a -crystal. We refer the reader to [3, Chapter 3] and [6, Chapter 7] for details. Note that for , where . We remark that the principal specialization of is equal to the -dimension of up to a power of , more precisely,
[TABLE]
Since is a -crystal, the operator defined as in acts on . The lemma below follows from Lemma 1.2 immediately.
Lemma 2.2**.**
The cyclic group has order and acts on the -crystal .
3. Cyclic sieving phenomenon
As before, assume that the Cartan matrix is of type . Let . Note that acts on the weight lattice . In addition, from the definition of and it follows that
[TABLE]
Lemma 3.1**.**
- (1)
For , we have
[TABLE] 2. (2)
Let and . Then
[TABLE]
Proof.
(1) As is linear, it suffices to consider the case where for . By a direct computation, we can derive that
[TABLE]
This tells us that .
(2) As above, due to the linearity of , we may assume that for . Note that . It follows from the identity that
[TABLE]
which justifies the assertion. ∎
For positive integers , we denote by the greatest common divisor of and . A subset is called a complete residue system modulo if it has no two elements that are congruent modulo .
Lemma 3.2**.**
Let and . Suppose that . Then, for any , the set is a complete residue system modulo .
Proof.
Let . Then we can write as for some . Since
[TABLE]
Lemma 3.1 implies that
[TABLE]
Combining these congruences, we derive that
[TABLE]
and thus, for ,
[TABLE]
Now, our assertion follows from the assumption . ∎
For two polynomials and , we write if is divisible by . We are now ready to state the main result on the cyclic sieving phenomenon for semistandard tableaux.
Theorem 3.3**.**
Assume that is a Young diagram with and . Then we have
- (1)
every orbit of under the action of is free, and 2. (2)
the triple exhibits the cyclic sieving phenomenon.
Proof.
(1) Let and denote by the set of all orbits of under the action of . Set
[TABLE]
for each orbit . Also, for , we set Since the cyclic group has order , we can deduce that
- (i)
divides , and 2. (ii)
.
But, since due to Lemma 3.2, we can deduce that
[TABLE]
as reqired.
(2) Note that
[TABLE]
For , we define
[TABLE]
As , Lemma 3.2 implies that
[TABLE]
for any orbit Combining this with the identity , which follows from (1), we derive that
[TABLE]
Now the assertion follows from Equation . ∎
Remark 3.4*.*
Theorem 3.3 does not hold necessarily true without the condition . To see this, consider the case where , and . Then . Since the crystal is the crystal of the adjoint representation of , we have
[TABLE]
It follows from the identity c(\epsilon_{i})=\left\{\begin{array}[]{ll}\epsilon_{i+1}&\text{ if }i\neq 5,\\ \epsilon_{1}&\text{ if }i=5,\end{array}\right. that every orbit is free or consists of a singleton. One can easily see that the number of free orbits equals and the number of fixed points equals . By a direct computation, we have
[TABLE]
This says that the triple does not exhibit the cyclic sieving phenomenon.
However, setting , we can observe that
[TABLE]
Hence, quite interestingly, the triple exhibits the cyclic sieving phenomenon.
4. Commuting action with
Recall that is the promotion on . For , let
[TABLE]
Proposition 4.1**.**
Let be a Young diagram with . Suppose that . Then we have
- (1)
for any , is divisible by , and 2. (2)
the order of on is divisible by .
Proof.
(1) Let and set
[TABLE]
Since and is the order of , by Lemma 3.2, we see that
[TABLE]
Since by definition, we have the assertion.
(2) It follows from (1) directly. ∎
Lemma 4.2**.**
Let be a Young diagram with . Suppose that is of hook shape or two-column shape. Then .
Proof.
To begin with, let us fix necessary notations for the proof.
For and , let . For , let , and we simply draw
(resp.
) for the one-row (resp. one-column) tableau with entries .
For , we write if appears in as an entry. For , we set to be the tableau obtained from by removing all boxes with entries in . We also define , and in a similar manner.
(Hook shape case)
We assume that is of hook shape, and choose any . We denote by (resp. ) the first column (resp. the first row) of . It is obvious that when . Thus we assume that . Let
[TABLE]
(Case 1) Suppose that . Then we can write and as follows:
[TABLE]
By a direct computation, we can see that
[TABLE]
which verifies the assertion since exchanges the number of and .
(Case 2) Suppose that , but . We first consider the case where . Then and can be written as follows:
[TABLE]
Thus we have
[TABLE]
which justifies the assertion as before.
In case where of , we can see that
[TABLE]
and thus
[TABLE]
as required.
(Case 3) Suppose that , but . Then is given as follows:
[TABLE]
If , then we have
[TABLE]
as required.
If , then we obtain
[TABLE]
and thus
[TABLE]
as required.
(Case 4) Suppose that . Then and can be written as follows:
[TABLE]
A direct computation yields that
[TABLE]
as required.
(Two-columns shape case)
We assume that is of two-column shape and . Let
[TABLE]
If , then there is nothing to prove since and . From now on, suppose that . Then we have the following cases:
[TABLE]
(Case 1) Suppose that or . Then can be written as follows:
[TABLE]
where or . Applying to , we have
[TABLE]
where or , respectively. This shows that .
(Case 2) Suppose that or . We first consider the case where . Then we can write as follows:
[TABLE]
In either case, the equality holds. Thus, it is easy to see that
[TABLE]
which implies that .
The remaining case where can be proved in the same manner.
(Case 3) Suppose that or . We first consider the case where . Then can be written as follows:
[TABLE]
Then we have
[TABLE]
respectively. By the same argument as in (Case 1) and (Case 2), we have
[TABLE]
Thus, we have that .
The remaining case where can be proved in the same manner. ∎
Remark 4.3*.*
It should be remarked that the identity is not true in general. Let us consider the case where , and
[TABLE]
Then
[TABLE]
Remark 4.4*.*
It should also be remarked that even in the case of a hook shape or a two-column shape (see [1, Proof of Proposition 3.2]). For example, we consider the case where and T=\tiny\begin{tabular}[]{|c|c|}\hline\cr 1&2\\ \hline\cr 2\\ \cline{1-1}\cr\end{tabular}\ . Then it is easy to see that
[TABLE]
Lemma 4.5**.**
Let be a Young diagram with . Suppose that is of hook shape or two-column shape. Then we have
[TABLE]
In particular, we have
Proof.
It was shown in [1, Proposition 3.2] that and for . For , we have
[TABLE]
Then, it follows from the definition that
[TABLE]
By Lemma 4.2, we have
[TABLE]
which completes the proof. ∎
In the following, we assume that
[TABLE]
Let be the cyclic group generated by acting on . Then the product group acts on . For , we set
[TABLE]
For an -tuple , let . We denote by the set of all contents of where varies over , and by the set of all such that . Notice that is invariant under for any . For clarity, denote by the restriction of to .
Theorem 4.6**.**
Suppose that holds. Then the following holds.
- (1)
For , . 2. (2)
For an -tuple with , let be the order of . Then the order of on equals , where denotes the least common multiple of .
Proof.
(1) Since and the order of is given by by Theorem 3.3 together with Proposition 4.1, we deduce that
[TABLE]
(2) By the assumption , we have that for . Thus, by (1), we have that
[TABLE]
∎
Example 4.7**.**
We consider the case where and . Then holds by Lemma 4.5 and . As , it follows that . In the case of , we have
[TABLE]
which tells us that the order . Finally, we can see that is decomposed into the following two orbits:
[TABLE]
Thus , and by Theorem 4.6, the order of is given by .
We now focus on the hook shape . In this case, a closed formula for the order of was given in [2].
Theorem 4.8** ([2, Theorem 3.9]).**
For a hook shape , the order of on is given as follows:
[TABLE]
Suppose that . Let and let denote the number of nonzero entries in . It was proved in [2] that the order of is given as
[TABLE]
and the triple exhibits the cyclic sieving phenomenon, where X(q)=\left[\begin{array}[]{c}\mathsf{m}(\alpha)-1\\ m\end{array}\right]_{q} is the -binomial coefficient. For , let be the monomial symmetric polynomial assocoated to and let be the Kostka-Foulkes polynomial associated with and (see [12] for the definitions). The following lemma is needed for the bicyclic sieving phenomenon on , which can be proved straightforwardly.
Lemma 4.9**.**
Let be a surjective homomorphism between finite cyclic groups. Suppose that the triple exhibits the cyclic sieving phenomenon. We set . Then the triple also exhibits the cyclic sieving phenomenon via the homomorphism .
We now have the following bicyclic sieving phenomenon.
Theorem 4.10**.**
Let with , and let and be the orders of and respectively. We set
[TABLE]
where and is defined in . Then the triple exhibits the bicyclic sieving phenomenon.
Proof.
Let be a finite set on which a finite group acts. For , let and let be the order of . Note that the symmetric group acts on by place permutation, i.e., for .
Let and choose any with . Let and set . Note that . It follows from Lemma 3.2 and Theorem 3.3 that
[TABLE]
For , we set and define
[TABLE]
and
[TABLE]
Note that , and for . Then the group clearly acts on . It follows from together with Lemma 4.5 that
[TABLE]
But, as every -orbit of is free by Theorem 3.3, we can deduce that
[TABLE]
Let
[TABLE]
Note that the triple exhibits the cyclic sieving phenomenon by [2, Theorem 4.3]. By the same argument as in the proof of Theorem 3.3, for any , one can show that also exhibits the cyclic sieving phenomenon. For , let be a primitive th root of unity. By the definition, we have
[TABLE]
Here, the second equality for follows from the fact that every -orbit is free. Thus, by putting Lemma 4.5, and together, we can derive that
[TABLE]
which tells us that the triple exhibits the bicyclic sieving phenomenon. Since , we conclude that exhibits the bicyclic sieving phenomenon by Lemma 4.9. Now the assertion follows from the equality ([11, Example 4.2] or [10, Lemma 7.12]). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Bandlow, A. Schilling, and N. Thiéry, On the uniqueness of promotion operators on tensor products of type A 𝐴 A crystals , J. Algebraic Combin. 31 (2010), no. 2 217–251.
- 2[2] M. Bennett, B. Madill, and A. Stokke, Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux , Discrete Math. 319 (2014), 62–67.
- 3[3] D. Bump and A. Schilling, Crystal bases. Representations and combinatorics , World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2017. xii+279 pp.
- 4[4] B. Fontaine and J. Kamnitzer, Cyclic sieving, rotation, and geometric representation theory , Selecta Math. (N.S.) 20 (2014), no. 2, 609–625.
- 5[5] M. D. Haiman, Dual equivalence with applications, including a conjecture of Proctor , Discrete Math. 99 (1992), no. 1-3, 79–113.
- 6[6] J. Hong and S.-J. Kang, Introduction to Quantum Groups and Crystal Bases , Graduate Studies in Mathematics, 42 . American Mathematical Society, Providence, RI, 2002.
- 7[7] M. Kashiwara, Crystalizing the q-analogue of universal enveloping algebras , Comm. Math. Phys. 133 (1990), no. 2, 249–260.
- 8[8] by same author, On crystal bases of the Q 𝑄 Q -analogue of universal enveloping algebras , Duke. Math. J. 154 (1991), 265–341.
