No abstract

In 2010, Rhoades proved that promotion on rectangular standard Young tableaux, together with the associated fake-degree polynomial, provides an instance of the cyclic sieving phenomenon. We extend this result to m-tuples of skew standard Young tableaux of the same shape, for fixed m, subject to the condition that the mth power of the associated fake-degree polynomial evaluates to nonnegative integers at roots of unity. However, we are unable to specify an explicit group action. Put differently, we determine in which cases the mth tensor power of a skew character of the symmetric group carries a permutation representation of the cyclic group. To do so, we use a method proposed by Amini and the first author, which amounts to establishing a bound on the number of border-strip tableaux of skew shape. Finally, we apply our results to the invariant theory of tensor powers of the adjoint representation of the general linear group. In particular, we prove the existence of a bijection between permutations and Stembridge’s alternating tableaux, which intertwines rotation and promotion.

In 2010, B. Rhoades proved that promotion together with the fakedegree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon.We extend this result to all skew standard Young tableaux where the fakedegree polynomial evaluates to nonnegative integers at roots of unity, albeit without being able to specify an explicit group action. Put differently, we determine in which cases a skew character of the symmetric group carries a permutation representation of the cyclic group.We use a method proposed by N. Amini and the first author, which amounts to establishing a bound on the number of border-strip tableaux of skew shape.Finally, we apply our results to the invariant theory of tensor powers of the adjoint representation of the general linear group. In particular, we prove the existence of a bijection between permutations and J. Stembridge's alternating tableaux, which intertwines rotation and promotion.

When λ is a partition, the specialized non-symmetric Macdonald polynomial E λ (x; q; 0) is symmetric and related to a modified Hall-Littlewood polynomial. We show that whenever all parts of the integer partition λ are multiples of n, the underlying set of fillings exhibit the cyclic sieving phenomenon (CSP) under an n-fold cyclic shift of the columns. The corresponding CSP polynomial is given by E λ (x; q; 0). In addition, we prove a refined cyclic sieving phenomenon where the content of the fillings is fixed. This refinement is closely related to an earlier result by B. Rhoades. We also introduce a skew version of E λ (x; q; 0). We show that these are symmetric and Schur positive via a variant of the Robinson-Schenstedt-Knuth correspondence and we also describe crystal raising and lowering operators for the underlying fillings. Moreover, we show that the skew specialized non-symmetric Macdonald polynomials are in some cases vertical-strip LLT polynomials. As a consequence, we get a combinatorial Schur expansion of a new family of LLT polynomials. 1.1. Main results. For an integer partition λ = (λ 1 ,. .. , λ), we let nλ denote the partition (nλ 1 ,. .. , nλ). We show that there is a natural action φ on the fillings COF(nλ, m) where each block of n consecutive columns is cyclically rotated one step. Consequently φ generates a C n-action on COF(nλ, m). In Theorem 3.2, we prove that for every n, m ∈ N + and integer partition λ, the triple (1)

We prove several new instances of the cyclic sieving phenomenon (CSP) on Catalan objects of type A and type B. Moreover, we refine many of the known instances of the CSP on Catalan objects. For example, we consider triangulations refined by the number of "ears", non-crossing matchings with a fixed number of short edges, and non-crossing configurations with a fixed number of loops and edges.