The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea
Source: hexagonmath.org/abs/2611.00525v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00525
curl -X POST /api/v1/records/hexagon/2611.00525/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00525/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'