The length polyhedron of an interval order

Abstract

The length polyhedron $Q_P$ of an interval order $P$ is the convex hull of integral vectors representing the interval lengths in interval representations of $P$. This polyhedron has been studied by various authors, including Fishburn and Isaak. Notably, $Q_P$ forms a pointed affine cone, a property inherited from being a projection of the representation polyhedron, a structure explored also by Doignon and Pauwels. The apex of the length polyhedron corresponds to Greenough's minimal endpoint representation, which is, in fact, the length vector of the canonical interval representation -- an interval representation that minimizes the sum of the interval lengths. Building on a combinatorial perspective of canonical representations, we refine Isaak's graph-theoretical model by introducing a new and simpler directed graph. From directed cycles of this key digraph, we extract a linear system of inequalities that precisely characterizes the length polyhedron $Q_P$. This combinatorial approach also reveals the unique Hilbert basis of the polyhedron. We prove that the intersection graph of the sets corresponding to these binary rays are Berge graphs; therefore they are perfect graphs. As a result, for interval orders with bounded width, the length polyhedron has a polynomial-sized Hilbert basis, which can be computed in polynomial time. We also provide an example of interval orders with a Hilbert basis of exponential size. In a companion paper we determine the Schrijver system for the length polyhedron. We conclude with open problems.