Facet numbers of non-centrally symmetric reflexive polytopes arising from posets
Aki Mori, Kenta Mori, Hidefumi Ohsugi

TL;DR
This paper investigates the facet counts of a class of non-centrally symmetric reflexive polytopes derived from posets, establishing an upper bound and characterizing cases of equality related to del Pezzo polygons.
Contribution
It proves an upper bound on the number of facets of twinned chain polytopes and characterizes when this bound is attained, partially confirming Nill's conjecture.
Findings
Maximum facet count is 6^{d/2} for d-dimensional twinned chain polytopes.
Equality occurs iff the polytope is a free sum of del Pezzo polygons.
Supports Nill's conjecture on reflexive polytope facets.
Abstract
Twinned chain polytopes form a broad class of non-centrally symmetric reflexive polytopes and exhibit intriguing structures. In the present paper, we show that the number of facets of -dimensional twinned chain polytopes is at most . In case is even, the equality holds if and only if the polytope is isomorphic to a free sum of copies of del Pezzo polygons. This result contributes a partial answer to Nill's conjecture: the number of facets of a -dimensional reflexive polytope is at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Computational Geometry and Mesh Generation · Geometric and Algebraic Topology
