Year: 2026
Type: preprint
Abstract: For a finite poset, we partition the edges of the order polytope and of the chain polytope into classes indexed by the connected convex subsets of the poset, and we establish that corresponding classes have the same cardinality. This yields a closed formula for the common number of edges, and it identifies the bijection of Hibi, Li, Sahara and Shikama as a disjoint union of simple bijections between corresponding classes, explaining why it is a bijection and how it acts on edge directions and lengths. As consequences, the two polytopes have equally many edge directions, with matching multiplicities, and, for every m, equally many pairs of vertices whose symmetric difference has m components; the chain polytope has at least as many edges parallel to each coordinate subspace as the order polytope; and the edge lengths of the chain polytope are dominated by those of the order polytope, with strict inequality in the last two comparisons exactly when the poset contains a three-element chain. We discuss implications for linear and convex combinatorial optimization over ideals and antichains. We also express the number of edges in terms of the comparability graph, extending to stable-set polytopes of all graphs; give a recursion for series-parallel posets and closed formulas for layered, zigzag and crown posets; and characterize the distributive lattices for which the two polytopes are unimodularly equivalent. Finally, either diameter can exceed the other arbitrarily; both are bounded by the width, and they coincide for series-parallel, zigzag and crown posets.
Source: arXiv (Cornell University)
Author: Lee, Jon
Institution: University of Michigan
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: Office of Naval Research
Award: G433683328
OpenAlex ID: W7220906434