Realizations of the associahedron and cyclohedron
From MaRDI portal
Publication:2369934
Abstract: We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and compare them to the permutahedron of type A_n and B_n respectively. The coordinates are obtained by an algorithm which uses an oriented Coxeter graph of type A_n or B_n respectively as only input and which specialises to a procedure presented by J.-L. Loday for a certain orientation of A_n. The described realizations have cambrian fans of type A and B as normal fans. This settles a conjecture of N. Reading for cambrian fans of these types.
The associahedron first arose purely as the graph corresponding to the bistellar operations on triangulations of a convex polygon which only use the vertices of the polygon. Later, it was shown how to realize this graph as the edge-graph of a suitable simple convex polytope. Indeed, this polytope can be taken to be the secondary polytope (a special case of a fibre polytope) of the projection of an appropriate simplex on the polygon. In a similar way, the cyclohedron corresponds to centrally symmetric triangulations of a centrally symmetric polygon. There is also a connexion with the permutahedra arising from the Coxeter groups of types \(A\) and \(B\), respectively. In this paper, the authors discuss realizations of these polytopes with integer coordinates for their vertices, comparing them with these permutahedra; these coordinates are obtained through an algorithm which uses the corresponding oriented Coxeter graphs of types \(A\) and \(B\) as the only input data.
Recommendations
- Realizing the associahedron: mysteries and questions
- Polytopal Realizations of Generalized Associahedra
- Many non-equivalent realizations of the associahedron
- A realization of graph associahedra
- Geometric realizations of the multiplihedra
- Realizations of regular polytopes
- scientific article; zbMATH DE number 3915097
- Geometric realizations of the 3D associahedron (multimedia exposition)
- Cyclohedron and Kantorovich-Rubinstein polytopes
- Simplex, associahedron, and cyclohedron
Cited in
(91)- Cambrian fans.
- Multitriangulations as complexes of star polygons
- Type-B generalized triangulations and determinantal ideals
- A type-B associahedron.
- Equivariant fiber polytopes
- Cyclohedron and Kantorovich-Rubinstein polytopes
- Brick polytopes, lattice quotients, and Hopf algebras
- Combinatorics and topology of Kawai-Lewellen-Tye relations
- Polytopal realizations of finite type \(\mathbf{g}\)-vector fans
- The weak order on integer posets
- Geometric realizations of the accordion complex of a dissection
- Realizing Simion's type \(B\) associahedron as a pulling triangulation of the Legendre polytope
- Enumerative properties of grid associahedra
- Coxeter-bicatalan combinatorics
- Realization of the Stasheff polytope
- Cambrian acyclic domains: counting \(c\)-singletons
- Cambrian triangulations and their tropical realizations
- Combinatorial generation via permutation languages. II. Lattice congruences
- Deformation cones of graph associahedra and nestohedra
- The diagonal of the operahedra
- Removahedral congruences versus permutree congruences
- Polytopal realizations and Hopf algebra structures for lattice quotients of the weak order
- The \(s\)-weak order and \(s\)-permutahedra
- Brick polytopes of spherical subword complexes and generalized associahedra
- Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
- Compatibility fans for graphical nested complexes
- Many non-equivalent realizations of the associahedron
- Cambrian Hopf algebras
- Lattice homomorphisms between weak orders
- Subword complexes, cluster complexes, and generalized multi-associahedra
- The diameter of associahedra
- The asymptotic diameter of cyclohedra
- Universal associahedra
- Non-kissing complexes for gentle algebras
- Type cones of permutree fans
- Shard polytopes
- The permuto-associahedron revisited
- On a remark of Loday about the associahedron and algebraic K-theory
- Minkowski decompositions of associahedra
- Unobstructed Stanley-Reisner degenerations for dual quotient bundles on G(2,n)
- The discrete fundamental group of the associahedron
- The Weak Order on Weyl Posets
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Lifted generalized permutahedra and composition polynomials
- Minkowski decomposition of associahedra and related combinatorics
- The extended permutohedron on a transitive binary relation.
- The brick polytope of a sorting network
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Signed tree associahedra
- Degenerations to unobstructed Fano Stanley-Reisner schemes
- Geometry of $\nu $-Tamari lattices in types $A$ and $B$
- Fan realizations for some 2-associahedra
- Colorful associahedra and cyclohedra
- How I `met' Dov Tamari
- Realizing the associahedron: mysteries and questions
- Cyclopermutohedron
- Quotientopes
- Non-kissing complexes and tau-tilting for gentle algebras
- Compatibility fans realizing graphical nested complexes
- Geometric realizations of the 3D associahedron (multimedia exposition)
- Labelled maximal tubings on paths and graph associahedra
- Vertex barycenter of generalized associahedra
- Hypergraph polytopes
- Permutrees
- Permutrees
- Cellular structures determined by polygons and trees
- Permutree sorting
- Geometric combinatorial algebras: Cyclohedron and simplex
- Hopf Monoids and Generalized Permutahedra
- Associahedra for finite‐type cluster algebras and minimal relations between g‐vectors
- Acyclic reorientation lattices and their lattice quotients
- Permutahedra and generalized associahedra.
- The type \(B\) permutohedron and the poset of intervals as a Tchebyshev transform
- Algebraic structures on graph associahedra
- Celebrating Loday's associahedron
- P-associahedra
- The s-weak order and s-permutahedra. II: The combinatorial complex of pure intervals
- The Hopf algebra of diagonal rectangulations.
- The \(s\)-weak order and \(s\)-permutahedra. I: Combinatorics and lattice structure
- Acyclic reorientation lattices and their lattice quotients
- Rectangulotopes
- Flips in colorful triangulations
- Wigglyhedra
- Shuffles of deformed permutahedra, multiplihedra, constrainahedra, and biassociahedra
- Combinatorial generation via permutation languages. IV: Elimination trees
- Associahedra via spines
- Simion's type \(B\) associahedron is a pulling triangulation of the Legendre polytope
- Separating trees and simple congruences of the weak order
- Computing distances on graph associahedra is fixed-parameter tractable
- Associahedron, cyclohedron and permutohedron as compactifications of configuration spaces
- A realization of graph associahedra
This page was built for publication: Realizations of the associahedron and cyclohedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369934)
