English

$f$-vector inequalities for order and chain polytopes

Combinatorics 2024-11-07 v3

Abstract

The order and chain polytopes are two 0/1-polytopes constructed from a finite poset. In this paper, we study the ff-vectors of these polytopes. We investigate how the order and chain polytopes behave under disjoint unions and ordinal sums of posets, and how the ff-vectors of these polytopes are expressed in terms of ff-vectors of smaller polytopes. Our focus is on comparing the ff-vectors of the order and chain polytope built from the same poset. In our main theorem we prove that for a family of posets built inductively by taking disjoint unions and ordinal sums of posets, for any poset P\mathcal{P} in this family the ff-vector of the order polytope of P\mathcal{P} is component-wise at most the ff-vector of the chain polytope of P\mathcal{P}.

Keywords

Cite

@article{arxiv.2312.13890,
  title  = {$f$-vector inequalities for order and chain polytopes},
  author = {Ragnar Freij-Hollanti and Teemu Lundström},
  journal= {arXiv preprint arXiv:2312.13890},
  year   = {2024}
}

Comments

Fixed typos, slight change to terminology, added one reference

R2 v1 2026-06-28T13:58:45.098Z