The \(n\)-dimensional associahedron is a certain convex \(n\)-polytope whose vertices are in one-to-one correspondence with the triangulations of a convex \((n+3)\)-gon and whose edges represent pairs of triangulations related by a flip of a single diagonal. Various polytopal realizations of the associahedron are known. The present paper introduces the spine of a triangulation of the \((n+3)\)-gon as the dual graph of the triangulation together with a labeling and an orientation. The approach to associahedra via spines extends the classical description of associahedra in terms of binary trees [\textit{J.-L. Loday}, Arch. Math. 83, No. 3, 267--278 (2004; Zbl 1059.52017)] and provides a new perspective on the realizations discovered in [\textit{C. Hohlweg} and \textit{C. E. M. C. Lange}, Discrete Comput. Geom. 37, No. 4, 517--543 (2007; Zbl 1125.52011)], leading in particular to new insights about their geometric and combinatorial properties.
- A Mackey formula in the group of a Coxeter group. With an appendix by J. Tits: Two properties of Coxeter complexes
- A realization of graph associahedra
- Acyclic sets of linear orders via the Bruhat orders
- Brick polytopes of spherical subword complexes and generalized associahedra
- Cambrian fans.
- Cambrian Hopf algebras
- Cambrian lattices.
- Cluster algebras. I: Foundations
- Cluster algebras. II: Finite type classification
- Constructions and complexity of secondary polytopes
- Coxeter complexes and graph-associahedra
- Discriminants, resultants, and multidimensional determinants
- Duality between quasi-symmetric functions and the Solomon descent algebra
- Faces of generalized permutohedra
- Homotopy Associativity of H-Spaces. I
- Hopf algebra of the planar binary trees
- scientific article; zbMATH DE number 3681764 (Why is no real title available?)
- scientific article; zbMATH DE number 745863 (Why is no real title available?)
- Introduction to algorithms.
- Lattice congruences of the weak order.
- Many non-equivalent realizations of the associahedron
- Matroid polytopes and their volumes
- Minkowski decomposition of associahedra and related combinatorics
- Mixed cobinary trees
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Nested complexes and their polyhedral realizations
- Permutahedra and generalized associahedra.
- Permutohedra, Associahedra, and Beyond
- Polyhedral models for generalized associahedra via Coxeter elements
- Polytopal Realizations of Generalized Associahedra
- Realization of the Stasheff polytope
- Realizations of the associahedron and cyclohedron
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Shellable nonpure complexes and posets. II
- Signed tree associahedra
- Subword complexes in Coxeter groups.
- The associahedron and triangulations of the \(n\)-gon
- The brick polytope of a sorting network
- The centers of gravity of the associahedron and of the permutahedron are the same
- The diameter of associahedra
- Vertex barycenter of generalized associahedra
- Which nestohedra are removahedra?
- Hopf algebras on decorated noncrossing arc diagrams
- Polytopal realizations of finite type \(\mathbf{g}\)-vector fans
- Towards a uniform subword complex description of acyclic finite type cluster algebras
- The associahedron and triangulations of the \(n\)-gon
- Cambrian acyclic domains: counting \(c\)-singletons
- Cambrian triangulations and their tropical realizations
- Combinatorial generation via permutation languages. II. Lattice congruences
- Removahedral congruences versus permutree congruences
- Compatibility fans for graphical nested complexes
- Cambrian Hopf algebras
- Type cones of permutree fans
- The permuto-associahedron revisited
- scientific article; zbMATH DE number 558336 (Why is no real title available?)
- Signed tree associahedra
- Fan realizations for some 2-associahedra
- Colorful associahedra and cyclohedra
- Quotientopes
- Non-kissing complexes and tau-tilting for gentle algebras
- Geometric realizations of the 3D associahedron (multimedia exposition)
- Permutrees
- Permutrees
- Cellular structures determined by polygons and trees
- Hopf Monoids and Generalized Permutahedra
- Associahedra for finite‐type cluster algebras and minimal relations between g‐vectors
- Celebrating Loday's associahedron
- Acyclic reorientation lattices and their lattice quotients
- Separating trees and simple congruences of the weak order
- Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
This page was built for publication: Associahedra via spines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722343)