REVIEW
The diameter of associahedra
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The diameter of associahedra
classification
math.CO
keywords
diameterargumentsassociahedraassociahedroncombinatorialconvexd-dimensionaldaniel
read the original abstract
It is proven here that the diameter of the d-dimensional associahedron is 2d-4 when d is greater than 9. Two maximally distant vertices of this polytope are explicitly described as triangulations of a convex polygon, and their distance is obtained using combinatorial arguments. This settles two problems posed about twenty-five years ago by Daniel Sleator, Robert Tarjan, and William Thurston.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.