math.CO — Combinatorics
The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea
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. J. Lee recently conjectured that for a connected poset the diameters of their graphs differ by at most . We show that this fails in both directions. For every we describe a connected poset with elements on three consecutive antidiagonals of the grid , for which the graph of has diameter exactly , while the graph of has diameter exactly . Their difference is therefore , and their ratio tends to . Hence no constant bounds on connected posets. In the other direction, for every we construct a connected poset with elements such that and . We also show that implies for every finite poset , so a difference of is the largest possible at order diameter .