Chapoton's simplicial-polytope conjecture for arbor polytopes

Let τ\tau be an arbor on the ground set [n]:={1,2,,n}[n]:=\{1,2,\dots,n\}, and let Qτ\mathcal Q_\tau be its associated nn-dimensional arbor polytope. Define h(τ)=(hi(τ))0inh(\tau)=(h_i(\tau))_{0\leq i\leq n}, where hi(τ)h_i(\tau) is the number of points in QτNn\mathcal Q_\tau\cap\mathbb N^n having exactly ii nonzero coordinates. Chapoton's conjecture. The vector h(τ)h(\tau) is equal to the hh-vector of an nn-dimensional simplicial polytope for every arbor τ\tau of size nn. In particular, h(τ)h(\tau) is palindromic and unimodal. This conjecture concerns the combinatorial structure of lattice-point enumerators of arbor polytopes; the supplied text records no resolution.

Sources & referencesView supporting material

Primary source

Christos A. Athanasiadis, Qiqi Xiao and Xue Yan, “Lattice point enumeration of some arbor polytopes”, arXiv:2603.11654 (2026).

Additional references

2 papers in this index state this conjecture (2025–2026). The statement above is taken from the most recent of them; the others are arXiv:2510.23903.

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.