On the facets of the Cayley polytope of Stanley's triangulation

@misc{qu2026facets,
  title = {{On the facets of the Cayley polytope of Stanley's triangulation}},
  author = {Yushan Qu and Jon Lee},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.35668},
  eprint = {2610.35668},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.35668},
}

TY  - UNPB
TI  - On the facets of the Cayley polytope of Stanley's triangulation
AU  - Yushan Qu
AU  - Jon Lee
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.35668
UR  - https://arxiv.org/abs/2610.35668
AB  - Disjunctions over the cells of a triangulation arise in formulations of piecewise-linear functions. For a poset P on [d], we study the convex hull D of the simplices of Stanley's triangulation of the order polytope of P, each lifted by its own indicator vector. Via the Cayley trick, for any disjunction of full-dimensional polytopes, the facets of the convex hull other than those described by the bounds on the indicator variables correspond to the facet normals of the Minkowski sum of the polytopes, and each is described by the full optimal big-M lifting of the supporting inequality with that normal of any one polytope. For Stanley's triangulation, with M(P) the Minkowski sum of its simplices, lifting only the facet-describing inequalities of the simplices need not suffice, unlike some other cases; we show that it suffices if and only if M(P) is alcoved, if and only if deleting one element of P leaves a chain. Otherwise, the coefficients of the additional facet-describing inequalities are governed by the least number ℓ(P) of elements whose deletion leaves a chain: for fixed ℓ(P), the largest entry of a primitive facet normal grows like d^ℓ(P)−1, and it can be exponential in d if ℓ(P) grows with d. For d ≥ 3 and ℓ(P)≤2 the sharp bound is d−2.
ER  -