← All problems

Cyclic sieving conjecture for promotion on fans of Dyck paths

19 years old · traced to

Let Dn(r)D_n^{(r)} be the set of all rr-fans of Dyck paths of length 2n2n, and define

gn,r(q)=∏1⩽i⩽j⩽n−1[i+j+2r]q[i+j]q,g_{n,r}(q)=\prod_{1\leqslant i\leqslant j\leqslant n-1}\frac{[i+j+2r]_q}{[i+j]_q},

where [m]q=1+q+q2+⋯+qm−1[m]_q=1+q+q^2+\cdots+q^{m-1}. Let C2nC_{2n} be the cyclic group of order 2n2n acting on Dn(r)D_n^{(r)} by promotion. Cyclic sieving conjecture for fans of Dyck paths. The triple (Dn(r),C2n,gn,r(q))(D_n^{(r)},C_{2n},g_{n,r}(q)) exhibits the cyclic sieving phenomenon. The conjecture concerns the interaction between promotion on fans of Dyck paths and the qq-analogue of their enumeration; the source gives examples but no general proof.

References

9 papers in this index state this conjecture (2007–2022). The statement above is taken from the most recent of them; the others are arXiv:2012.12219, arXiv:2006.01568, arXiv:1804.01447, arXiv:1305.7286, arXiv:1108.5245, arXiv:1009.4690, arXiv:1007.4584, arXiv:math/0701792.

Source: Joseph Pappe, Stephan Pfannerer, Anne Schilling and Mary Claire Simone, “Promotion and growth diagrams for fans of Dyck paths and vacillating tableaux”, arXiv:2212.13588 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.