Minuscule P-partition cyclic sieving conjecture

Let PP be a minuscule poset, let r(P)r(P) denote its rank, and set h=r(P)+2h=r(P)+2. For 1\ell\geq 1, let PP(P)\mathrm{PP}^{\ell}(P) be the PP-partitions of height \ell, let row\mathrm{row} be piecewise-linear rowmotion, and define

F(P,)=pP1qr(p)++11qr(p)+1.F(P,\ell)=\prod_{p\in P}\frac{1-q^{r(p)+\ell+1}}{1-q^{r(p)+1}}.

Minuscule P-partition cyclic sieving conjecture. For every 1\ell\geq 1, the triple

(PP(P),row,F(P,))(\mathrm{PP}^{\ell}(P),\langle\mathrm{row}\rangle,F(P,\ell))

exhibits the cyclic sieving phenomenon.

This extends the known order-=1\ell=1 result of Rush and Shi and is known for rectangles by work of Rhoades. The conjecture remains open in the supplied text.

Sources & referencesView supporting material

Primary source

Sam Hopkins, “Minuscule doppelgängers, the coincidental down-degree expectations property, and rowmotion”, arXiv:1902.07301 (2020).

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.