Cyclic sieving conjecture for staircase flagged tableaux

Let scn=(n,n1,,2,1)sc_n=(n,n-1,\ldots,2,1) and let b=(+1,+2,,+n)b=(\ell+1,\ell+2,\ldots,\ell+n). Define

Cat(x):=j=01i=1n1xn+1+i+2j1xi+2j.Cat_{\ell}(x):=\prod_{j=0}^{\ell-1}\prod_{i=1}^{n}\frac{1-x^{n+1+i+2j}}{1-x^{i+2j}}.

Staircase flagged-tableaux cyclic sieving conjecture. The triple (FT(scn,b),Pro,Cat(x))(\mathrm{FT}(sc_n,b),\langle\operatorname*{Pro}\rangle,Cat_{\ell}(x)) exhibits the cyclic sieving phenomenon.

This conjecture is stated in terms of flagged tableaux by Serrano and Stump and in terms of multi-cluster complexes by Ceballos, Labbé, and Stump. The case =1\ell=1 follows from Eu and Fu, but the case >1\ell>1 remains open.

Sources & referencesView supporting material

Primary source

Joseph Bernstein, Jessica Striker and Corey Vorland, “P-strict promotion and B-bounded rowmotion, with applications to tableaux of many flavors”, arXiv:2012.12219 (2021).

Additional references

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

Source: https://arxiv.org/abs/2012.12219 Serrano and Stump (year not specified), cited work on flagged tableaux Ceballos, Labbé, and Stump (2014), cited work on multi-cluster complexes Eu and Fu (2008), cited result on cyclic sieving of faces of generalized cluster complexes

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.