English

Cyclic sieving on noncrossing (1,2)-configurations

Combinatorics 2024-02-09 v1

Abstract

Verifying a suspicion of Propp and Reiner concerning the cyclic sieving phenomenon (CSP), M. Thiel introduced a Catalan object called noncrossing (1,2)(1,2)-configurations (denoted by XnX_n), which is a class of set partitions of [n1][n-1]. More precisely, Thiel proved that, with a natural action of the cyclic group Cn1C_{n-1} on XnX_n, the triple (Xn,Cn1,Catn(q))\left(X_n,C_{n-1},\text{Cat}_n(q)\right) exhibits the CSP, where Catn(q):=1[n+1]q[2nn]q\text{Cat}_n(q):=\frac{1}{[n+1]_q}\begin{bmatrix} 2n\\ n \end{bmatrix}_q is MacMahon's qq-Catalan number. Recently, in a study of the fermionic diagonal coinvariant ring FDRnFDR_n, J. Kim found a combinatorial basis for FDRnFDR_n indexed by XnX_n. In this paper, we continue to study XnX_n and obtain the following results: (1) We define a statistic cwtcwt on XnX_n whose generating function is Catn(q)\text{Cat}_n(q), which answers a problem of Thiel. (2) We show that Catn(q)\text{Cat}_n(q) is equivalent to k,x,y2k+x+y=n1[n12k,x,y]qCatk(q)qk+(x2)+(y2)+(n2)\sum_{\substack{k,x,y\\2k+x+y=n-1}}\begin{bmatrix} n-1 2k,x,y \end{bmatrix}_q\text{Cat}_k (q)q^{k+\binom{x}{2}+\binom{y}{2}+\binom{n}{2}} modulo qn11q^{n-1}-1, which answers a problem of Kim. As mentioned by Kim, this result leads to a representation theoretic proof of the above cyclic sieving result of Thiel. (3) We consider the dihedral sieving, a generalization of the CSP, which was recently introduced by Rao and Suk. Under a natural action of the dihedral group I2(n1)I_2(n-1) (for even nn), we prove a dihedral sieving result on XnX_n.

Keywords

Cite

@article{arxiv.2402.05771,
  title  = {Cyclic sieving on noncrossing (1,2)-configurations},
  author = {Chuyi Zeng and Shiwen Zhang},
  journal= {arXiv preprint arXiv:2402.05771},
  year   = {2024}
}
R2 v1 2026-06-28T14:43:03.075Z