Indexed metadata

Two-Dimensional Faces of Order and Chain Polytopes

Ragnar Freij-Hollanti, Teemu Lundström, Aki Mori

Source record

Source: Crossref

Published: Sep 11, 2026

DOI: 10.37236/14909

Open original source ↗

Source abstract

To a finite poset PP with nn elements, Stanley introduced two nn-dimensional polytopes, the order polytope O(P)\mathcal{O}(P) and the chain polytope C(P)\mathcal{C}(P). These polytopes are known to have the same volumes and the same numbers of vertices and edges, while C(P)\mathcal{C}(P) is known to have strictly more facets than O(P)\mathcal{O}(P), except in the cases where the polytopes are unimodularly equivalent. In this paper, we study the structure of the two-dimensional faces of the two polytopes. We give combinatorial parametrizations of the 22-dimensional faces of both polytopes. In the case of the order polytope, these parametrizations are adaptions of descriptions of faces by Geissinger and Stanley, while in the case of the chain polytope, the characterizations themselves are novel. To parametrize the triangle faces in particular, we introduce the notions of biconnected filters and biconnected antichains in a poset, of possible independent interest. Using these parametrizations, we show that for any PP, C(P)\mathcal{C}(P) has equally many square faces, and at least as many triangular faces, as O(P)\mathcal{O}(P) does. Moreover, the inequality is shown to be strict except when O(P)\mathcal{O}(P) and C(P)\mathcal{C}(P) are unimodularly equivalent. This proves the case i=2i=2 of a conjecture by Hibi and Li.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.