Simplicial and flag-simplicial h-vector conjectures for preorder polytopes

Let τ\tau be a preorder of size nn. For 0in0\leq i\leq n, let hi(τ)h_i(\tau) count the lattice points of Qτ\mathcal Q_\tau with exactly ii nonzero coordinates, and write h(τ)=(h0(τ),,hn(τ))h(\tau)=(h_0(\tau),\ldots,h_n(\tau)). Simplicial h-vector conjecture. For every preorder τ\tau of size nn, the following assertions hold in increasing strength: (a) hi(τ)=hni(τ)h_i(\tau)=h_{n-i}(\tau); (b) h(τ)h(\tau) is palindromic and h0(τ)hn/2(τ)h_0(\tau)\leq\cdots\leq h_{\lfloor n/2\rfloor}(\tau); (c) h(τ)h(\tau) is the hh-vector of an nn-dimensional simplicial polytope; and (d) h(τ)h(\tau) is the hh-vector of an nn-dimensional flag simplicial polytope. The source presents these as a hierarchy of conjectures and gives no resolution for general preorders.

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.