Transpose-and-rowmotion cyclic sieving conjecture for even-height plane partitions

Let PP2M(2n×2n)\mathrm{PP}^{2M}(2n\times2n) denote plane partitions in a 2n×2n2n\times2n box of height at most 2M2M, let Tr\mathrm{Tr} denote transposition, and let Row\mathrm{Row} denote rowmotion. Set ζ=eπi/(2n)\zeta=e^{\pi i/(2n)}, a primitive (4n)(4n)th root of unity, and

F(q)=1i,jn1q2(i+j+M1)1q2(i+j1).F(q)=\prod_{1\leq i,j\leq n}\frac{1-q^{2(i+j+M-1)}}{1-q^{2(i+j-1)}}.

Transpose-and-rowmotion cyclic sieving conjecture. For every kZk\in\mathbb Z,

#{πPP2M(2n×2n):Tr(π)=π, Row2n(π)=π, Rowk(π)=π}=F(ζk).\#\{\pi\in\mathrm{PP}^{2M}(2n\times2n):\mathrm{Tr}(\pi)=\pi,\ \mathrm{Row}^{2n}(\pi)=\pi,\ \mathrm{Row}^{k}(\pi)=\pi\}=F(\zeta^k).

This is the corner-triangular reformulation in the source; the supplied text gives no resolution.

Sources & referencesView supporting material

Primary source

Sam Hopkins, “Cyclic Sieving for Plane Partitions and Symmetry”, arXiv:1907.09337 (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.