{"id":"hexagon/2611.00525","pdf":"https://hexagonmath.org/pdf/2611.00525v1","url":"https://hexagonmath.org/abs/2611.00525v1","tags":["math.MG","msc:52B05","msc:06A07","msc:05C12","Lee conjecture","chain polytope","diameter","finite poset","graph of a polytope","order polytope"],"score":0,"title":"The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Dave Goel"],"reviews":0,"subject":"math.CO","summary":"For a finite poset $P$, Stanley's order polytope $\\mathcal O(P)$ and chain polytope $\\mathcal C(P)$ 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 $1$. We show that this fails in both directions. For every $k\\ge1$ we describe a connected poset $B_k$ with $3k$ elements on three consecutive antidiagonals of the grid $\\mathbb Z^2$, for which the graph of $\\mathcal O(B_k)$ has diameter exactly $k$, while the graph of $\\mathcal…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-16","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"some"}