📝 SummarXiv

Abstract

We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, 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.