Lattice-realization conjecture for preorder lattice-point posets

Let τ\tau be a preorder of size nn, let PτP_\tau be its lattice-point poset, let MPτ(x,y)M_{P_\tau}(x,y) be its MM-triangle, and let MPτ\overline{M}_{P_\tau} be the transmutation defined by

f(x,y)=f(1y1xy,1xy).\overline f(x,y)=f\left(\frac{1-y}{1-xy},1-xy\right).

Lattice-realization conjecture. There exists a finite graded lattice LτL_\tau of rank nn such that

Z(Pτ,t)=Z(Lτ,t),MPτ(x,y)=MLτ(x,y).\mathcal Z(P_\tau,t)=\mathcal Z(L_\tau,t),\qquad \overline M_{P_\tau}(x,y)=M_{L_\tau}(x,y).

In particular, the rank-generating polynomial of LτL_\tau equals h(τ,t)h(\tau,t). The conjecture extends the arbor setting; the source gives examples for chain preorders but no general resolution.

Sources & referencesView supporting material

Primary source

Frédéric Chapoton and Christos A. Athanasiadis, “Polytopes and posets associated to preorders”, arXiv:2605.26916 (2026).

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.