Preorder polytopes: matching endpoint pairs, flag spheres and the Athanasiadis–Chapoton conjectures
Unrefereed research candidate. In one sentence: for every preorder that contains no “crown”, the support polynomial of its preorder polytope is the h-polynomial of a flag simplicial sphere, which settles the flag form of a 2026 conjecture of Athanasiadis and Chapoton for that class. The release also identifies the gamma-coefficients as counts of matchable pairs (found at the same time, independently, by Y. Zhong) and proves two Ehrhart conjectures from the same paper. The objects. A preorder is a way of ranking things in which ties are allowed. Athanasiadis and Chapoton (arXiv:2605.26916) attached to each preorder τ on n elements a lattice polytope Qτ: its integer points are the ways of putting nonnegative whole-number loads on the elements so that no downward-closed group carries more than its own size. Counting these points by how many loads are nonzero gives a polynomial Hτ(t). For the chain 1 < 2 < 3 the counts are 1, 6, 6, 1, and 1 + 6t + 6t2 + t3 = (1+t)3 + 3t(1+t); the 3 counts the three ways to pick one element and one strictly above it. The conjectures. Athanasiadis and Chapoton conjectured that Hτ always looks like the h-polynomial of a sphere: palindromic, unimodal, gamma-positive (a nonnegative combination of tj(1+t)n−2j) and realised by a simplicial, even a flag simplicial, polytope. They also conjectured several Ehrhart identities. Gal conjectured that flag spheres always have gamma-positive h-polynomials, so families that are both gamma-positive and realised by flag spheres are natural test cases. Results. (1) The gamma-coefficient γj counts ordered pairs of disjoint j-element sets that can be matched upwards in τ; this proves gamma-positivity (their Conjecture 5.2). Y. Zhong (arXiv:2611.16858, 12 November 2026) obtained the same formula independently and concurrently, by the same route. (2) New here: if τ contains no crown (2k ≥ 6 elements joined in a closed zig-zag), then Hτ is the h-polynomial of the boundary of an n-dimensional flag simplicial polytope (Conjecture 5.1(d) for this class). The class includes all arbors (Chapoton’s original setting), compositions, width-two posets, series–parallel and interval orders, and every preorder with at most five blocks. The proof builds a quadratic Gröbner basis for a root polytope, adapting Ohsugi–Hibi and Ohsugi–Tsuchiya; the new step is to pull a special simplex first. For preorders with a crown, the two polytopes used here have no flag regular unimodular triangulation, and the six-element crown is the smallest open case. (3) Matrix Ehrhart–zeta duality (Conjecture 4.2) and double Ehrhart reciprocity (Conjecture 7.2) hold for every preorder; the descent formula (Conjecture 4.4) and the zeta value Z(Pτ, −1) = (−1)n #max(Pτ) follow. Also: a simplicial-polytope realisation for every preorder (Conjecture 5.1(c)), an explicit reflexive polytope with Ehrhart numerator Hτ, and a table of the status of every conjecture in the originating paper (Conjecture 5.4 was proved by Dai et al., Conjecture 6.3 by Luo, and Conjecture 5.3 is false by Patel’s example). Limits. The flag result covers crown-free preorders only. Several of the Ehrhart proofs are short applications of standard tools (Postnikov’s lattice-point formula, Ehrhart–Macdonald reciprocity, Athanasiadis’s special-simplex theorem). Magic positivity, Conjectures 6.2, 8.1 and 8.2 and the q-form of Conjecture 4.9 remain open. Contents. The paper (LaTeX source and PDF); exact Python checks with a runner that compares every output byte for byte in normal and python -O mode (all 355 labelled four-element preorders and smaller ones, 24 seeded preorders at each size 5–8, 689 small bipartite graphs, 560 matrix-duality cases, 390 preorders for the corollaries); flag-sphere checks on 570 crown-free preorders and Macaulay2 Gröbner-basis certificates for 461; all saved outputs; a report on prior and concurrent work; the bibliography from registry records; a machine-readable index; a research-gate record; a replay receipt and SHA-256 sums. Assurance. Written proofs; the computations are finite regression checks of conventions and small cases, not part of any proof. Internal AI-assisted review only: not peer review, independent reproduction or formal verification. Creator: Anonymous. Text and data CC0-1.0; code MIT.
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24235776
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint