Two-Dimensional Faces of Order and Chain Polytopes

To a finite poset $P$ with $n$ elements, Stanley introduced two $n$-dimensional polytopes, the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$. These polytopes are known to have the same volumes and the same numbers of vertices and edges, while $\mathcal{C}(P)$ is known to have strictly more facets than $\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 $2$-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 $P$, $\mathcal{C}(P)$ has equally many square faces, and at least as many triangular faces, as $\mathcal{O}(P)$ does. Moreover, the inequality is shown to be strict except when $\mathcal{O}(P)$ and $\mathcal{C}(P)$ are unimodularly equivalent. This proves the case $i=2$ of a conjecture by Hibi and Li.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-09-11
DOI
https://doi.org/10.37236/14909
Primary Topic
Mathematics and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Two-Dimensional Faces of Order and Chain Polytopes

Aki Mori, Ragnar Freij-Hollanti, Teemu Lundström
The Electronic Journal of Combinatorics
Mathematics and Applications
article

Two-Dimensional Faces of Order and Chain Polytopes

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

Abstract

To a finite poset $P$ with $n$ elements, Stanley introduced two $n$-dimensional polytopes, the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$. These polytopes are known to have the same volumes and the same numbers of vertices and edges, while $\mathcal{C}(P)$ is known to have strictly more facets than $\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 $2$-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 $P$, $\mathcal{C}(P)$ has equally many square faces, and at least as many triangular faces, as $\mathcal{O}(P)$ does. Moreover, the inequality is shown to be strict except when $\mathcal{O}(P)$ and $\mathcal{C}(P)$ are unimodularly equivalent. This proves the case $i=2$ of a conjecture by Hibi and Li.

The Electronic Journal of CombinatoricsVol. 33(3)
Osaka Electro-Communication University (JP), Aalto University (FI)
Aalto-Yliopisto
Openalex Percentile: Top 91%
Mathematics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.