Matching works

2 works

math.CO — Combinatorics

The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea

Contributed by Dave Goel

For a finite poset PP, Stanley's order polytope O(P)\mathcal O(P) and chain polytope C(P)\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 11. We show that this fails in both directions. For every k≥1k\ge1 we describe a connected poset BkB_k with 3k3k elements on three consecutive antidiagonals of the grid Z2\mathbb Z^2, for which the graph of O(Bk)\mathcal O(B_k) has diameter exactly kk, while the graph of C(Bk)\mathcal C(B_k) has diameter exactly ⌊2k/3⌋+1\lfloor2k/3\rfloor+1. Their difference is therefore ⌈k/3⌉−1\lceil k/3\rceil-1, and their ratio tends to 3/23/2. Hence no constant bounds diam⁡O(P)−diam⁡C(P)\operatorname{diam}\mathcal O(P)-\operatorname{diam}\mathcal C(P) on connected posets. In the other direction, for every n≥4n\ge4 we construct a connected poset PnP_n with 2n2+5n+12n^2+5n+1 elements such that diam⁡O(Pn)=2\operatorname{diam}\mathcal O(P_n)=2 and diam⁡C(Pn)=4\operatorname{diam}\mathcal C(P_n)=4. We also show that diam⁡O(P)≤2\operatorname{diam}\mathcal O(P)\le2 implies diam⁡C(P)≤4\operatorname{diam}\mathcal C(P)\le4 for every finite poset PP, so a difference of 22 is the largest possible at order diameter 22.

Author comments: First version: October 23, 2026. This is the expanded version of the paper "Diameters of the order and chain polytopes of a connected poset", which is at https://hexagonmath.org/2611.00523 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsLee conjecturechain polytopediameterfinite posetgraph of a polytopeorder polytope
Nov 16, 202631 pages
PDFView work

math.CO — Combinatorics

Diameters of the order and chain polytopes of a connected poset

Contributed by Dave Goel

For a finite poset PP, Stanley's order polytope O(P)\mathcal O(P) and chain polytope C(P)\mathcal C(P) 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 11. We show that on connected posets, too, the two diameters can be far apart. For every k≥1k\ge1 we describe a connected poset BkB_k with 3k3k elements whose order polytope has graph diameter kk and whose chain polytope has graph diameter at most ⌊3(k+1)/4⌋\lfloor3(k+1)/4\rfloor; hence the first diameter can exceed the second by any amount. For every n≥4n\ge4 we construct a connected poset PnP_n with 2n2+5n+12n^2+5n+1 elements whose order polytope has graph diameter 22 and whose chain polytope has graph diameter 44. Finally, for every finite poset PP, if the graph of O(P)\mathcal O(P) has diameter at most 22, then the graph of C(P)\mathcal C(P) has diameter at most 44; so 22 is the largest possible difference when the order polytope has graph diameter 22.

Author comments: First version: October 28, 2026. The expanded version of this paper, "The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea", is at https://doi.org/10.5281/zenodo.23351398 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partschain polytopediameterfinite posetgraph of a polytopeorder polytope
Nov 16, 202619 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations