The diameter of type D associahedra and the non-leaving-face property
From MaRDI portal
(Redirected from Publication:499452)
The diameter of type \(D\) associahedra and the non-leaving-face property
The diameter of type \(D\) associahedra and the non-leaving-face property
Abstract: Generalized associahedra were introduced by S. Fomin and A. Zelevinsky in connection to finite type cluster algebras. Following recent work of L. Pournin in types and , this paper focuses on geodesic properties of generalized associahedra. We prove that the graph diameter of the -dimensional associahedron of type is precisely for all greater than . Furthermore, we show that all type associahedra have the non-leaving-face property, that is, any geodesic connecting two vertices in the graph of the polytope stays in the minimal face containing both. This property was already proven by D. Sleator, R. Tarjan and W. Thurston for associahedra of type . In contrast, we present relevant examples related to the associahedron that do not always satisfy this property.
Recommendations
Cites work
- \(Y\)-systems and generalized associahedra
- A generalization of diagonal flips in a convex polygon
- A point set whose space of triangulations is disconnected
- Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
- Brick polytopes of spherical subword complexes and generalized associahedra
- Cambrian fans.
- Cambrian lattices.
- Cluster algebras and triangulated surfaces. I: Cluster complexes
- Cluster algebras. I: Foundations
- Cluster algebras. II: Finite type classification
- Coxeter complexes and graph-associahedra
- Enumerating pseudo-triangulations in the plane
- Graph properties of graph associahedra
- Homotopy Associativity of H-Spaces. I
- scientific article; zbMATH DE number 970062 (Why is no real title available?)
- scientific article; zbMATH DE number 2209740 (Why is no real title available?)
- Lectures on Polytopes
- Multitriangulations as complexes of star polygons
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Paths on Polyhedra. I
- Permutahedra and generalized associahedra.
- Polytopal Realizations of Generalized Associahedra
- Pseudo-triangulations -- a survey
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Subword complexes, cluster complexes, and generalized multi-associahedra
- The asymptotic diameter of cyclohedra
- The brick polytope of a sorting network
- The diameter of associahedra
- The Hirsch conjecture holds for normal flag complexes
- Triangulations. Structures for algorithms and applications
Cited in
(13)- Once punctured disks, non-convex polygons, and pointihedra
- Non-leaving-face property for marked surfaces
- The asymptotic diameter of cyclohedra
- Diameters and geodesic properties of generalizations of the associahedron
- \(W\)-associahedra have the non-leaving-face property
- On support -tilting graphs of gentle algebras
- Exchange graphs of cluster algebras have the non‐leaving‐face property
- Celebrating Loday's associahedron
- The rotation distance of brooms
- Shortest paths on polymatroids and hypergraphic polytopes
- Wigglyhedra
- Counting geodesics between surface triangulations
- Cluster algebras of type \(D\): pseudotriangulations approach
This page was built for publication: The diameter of type \(D\) associahedra and the non-leaving-face property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499452)