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

A mix of human-written and AI-generated textHuman understanding: some partsmath.CO — Combinatoricsmath.MG — Metric Geometry

Contributed by Dave Goel ↗

Version 1 / Nov 16, 2026 / CC BY-SA 4.0

Abstract

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.

Provenance statement

This work was done overwhelmingly by AI models and supervised by the author. The models were Anthropic's Claude and OpenAI's ChatGPT. The author takes full responsibility for the paper.

References

  1. F. Aliniaeifard, C. Benedetti, N. Bergeron, S. X. Li and F. Saliola, Stable set polytopes and their 1-skeleta, arXiv:1804.00360v3, 2021.arXiv
  2. V. Chvátal, On certain polytopes associated with graphs, J. Combin. Theory Ser. B 18 (1975), 138--154.
  3. D. Goel, The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, Zenodo, 2026 (short version of this paper), https://doi.org/10.5281/zenodo.23716603.DOI
  4. T. Hibi and N. Li, Cutting convex polytopes by hyperplanes, Mathematics 7 (5) (2019), Article 381.
  5. T. Hibi, N. Li, Y. Sahara and A. Shikama, The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set, Discrete Math. 340 (2017), 991--994.
  6. Y. T. Ikebe and A. Tamura, Ideal polytopes and face structures of some combinatorial optimization problems, Math. Programming 71 (1995), 1--15.
  7. J. Lee, A refinement of the edge theorem for order and chain polytopes, arXiv:2610.07413, version 1, October 5, 2026. We cite the numbering of version 1; versions 2 and 3 (October 12 and 24, 2026) withdraw Conjecture 29.arXiv
  8. R. P. Stanley, Two poset polytopes, Discrete Comput. Geom. 1 (1986), 9--23.

Version history

  1. v1 · 31 pagesSubmitted by Dave GoelFirst 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.CurrentNov 16, 2026