Triangular faces of the order and chain polytope of a maximal ranked poset

Abstract

Let O(P) and C(P) denote the order polytope and chain polytope, respectively, associated with a finite poset P. We prove the following result: if P is a maximal ranked poset, then the number of triangular 2-faces of O(P) is less than or equal to that of C(P), with equality holding if and only if P does not contain an X-poset as a subposet.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…