The arbor polytope h-vector realization conjecture

Let tt be an arbor, and let hth_t denote its hh-vector. A simple polytope is a polytope whose every vertex lies on exactly as many facets as its dimension; write h(Φt)h(\Phi_t) for the hh-vector of a simple polytope Φt\Phi_t.

The arbor polytope h-vector realization conjecture. For every arbor tt, there exists a simple polytope Φt\Phi_t such that

ht=h(Φt).h_t=h(\Phi_t).

This is the weakest of a sequence of proposed realizations relating arbor posets and polytopes. The source says that stronger constructions are not known in general and supplies no resolution of this h-vector realization claim.

Sources & referencesView supporting material

Primary source

Frédéric Chapoton, “On posets and polytopes attached to arbors”, arXiv:2503.04247 (2025).

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.