The diameter of associahedra
From MaRDI portal
Publication:2450096
DOI10.1016/j.aim.2014.02.035zbMath1292.52011arXiv1207.6296OpenAlexW2022116663WikidataQ56067258 ScholiaQ56067258MaRDI QIDQ2450096
Publication date: 16 May 2014
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.6296
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial complexity of geometric structures (52C45)
Related Items (41)
Simultaneous flips on triangulated surfaces ⋮ Restricted rotation distance between k-ary trees ⋮ Curves on the torus intersecting at most k times ⋮ The asymptotic diameter of cyclohedra ⋮ Compatibility fans for graphical nested complexes ⋮ Higher secondary polytopes and regular plabic graphs ⋮ Flip-graph moduli spaces of filling surfaces ⋮ Distances in Domino Flip Graphs ⋮ Modular flip-graphs of one-holed surfaces ⋮ A proof of the orbit conjecture for flipping edge-labelled triangulations ⋮ Enumerative problems for arborescences and monotone paths on polytope graphs ⋮ Lagrangian fillings in \(A\)-type and their Kálmán loop orbits ⋮ Sampling planar tanglegrams and pairs of disjoint triangulations ⋮ Celebrating Loday's associahedron ⋮ Rotation distance for rank bounded trees ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Arc diagrams, flip distances, and Hamiltonian triangulations ⋮ Flipping edge-labelled triangulations ⋮ The rotation distance of brooms ⋮ The genus of curve, pants and flip graphs ⋮ NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON ⋮ Flip graphs, Yoke graphs and diameter ⋮ Edge Conflicts do not Determine Geodesics in the Associahedron ⋮ The diameter of type \(D\) associahedra and the non-leaving-face property ⋮ Flipping in spirals ⋮ On the diameter of tree associahedra ⋮ \(W\)-associahedra have the non-leaving-face property ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ Associahedra via spines ⋮ Once punctured disks, non-convex polygons, and pointihedra ⋮ Rainbow Cycles in Flip Graphs ⋮ On flips in planar matchings ⋮ Transition operations over plane trees ⋮ Flip distances between graph orientations ⋮ Non-leaving-face property for marked surfaces ⋮ The geometry of flip graphs and mapping class groups ⋮ Rainbow Cycles in Flip Graphs. ⋮ Diameter estimates for graph associahedra ⋮ A Motzkin filter in the Tamari lattice ⋮ Competitive Online Search Trees on Trees ⋮ Neighborhoods of trees in circular orderings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructions and complexity of secondary polytopes
- On the rotation distance between binary trees
- Triangulations. Structures for algorithms and applications
- A realization of graph associahedra
- Multitriangulations as complexes of star polygons
- Fiber polytopes
- \(Y\)-systems and generalized associahedra
- The associahedron and triangulations of the \(n\)-gon
- Realization of the Stasheff polytope
- Realizations of the associahedron and cyclohedron
- Many non-equivalent realizations of the associahedron
- Permutohedra, Associahedra, and Beyond
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Lectures on Polytopes
- Triangulations of cyclic polytopes and higher Bruhat orders
- Polytopal Realizations of Generalized Associahedra
- How I ‘met’ Dov Tamari
- Homotopy Associativity of H-Spaces. I
- Monoïdes préordonnés et chaînes de Malcev
This page was built for publication: The diameter of associahedra
