Simplex inequalities of order and chain polytopes of recursively defined posets

Abstract

In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint unions and ordinal sums, then $\mathcal{C}(P)$ has at least as many $k$-dimensional simplex faces as $\mathcal{O}(P)$ does, for each dimension $k$. This generalizes a previous result of Mori, both in terms of the dimensions of the simplices and in terms of the class of posets considered.