math.CO — Combinatorics
Diameters of the order and chain polytopes of a connected poset
For a finite poset , Stanley's order polytope and chain polytope have the same number of vertices and, by a theorem of Hibi, Li, Sahara and Shikama, the same number of edges. On disconnected posets the diameters of their graphs can differ by any amount, since both diameters add over disjoint unions and already differ on small examples, but on connected posets a computer search of Lee found no difference larger than . We show that on connected posets, too, the two diameters can be far apart. For every we describe a connected poset with elements whose order polytope has graph diameter and whose chain polytope has graph diameter at most ; hence the first diameter can exceed the second by any amount. For every we construct a connected poset with elements whose order polytope has graph diameter and whose chain polytope has graph diameter . Finally, for every finite poset , if the graph of has diameter at most , then the graph of has diameter at most ; so is the largest possible difference when the order polytope has graph diameter .