The arbor polytope h-vector realization conjecture
The arbor polytope h-vector realization conjecture
Let be an arbor, and let denote its -vector. A simple polytope is a polytope whose every vertex lies on exactly as many facets as its dimension; write for the -vector of a simple polytope .
The arbor polytope h-vector realization conjecture. For every arbor , there exists a simple polytope such that
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.