Quotientopes
From MaRDI portal
Abstract: For any lattice congruence of the weak order on , N. Reading proved that glueing together the cones of the braid fan that belong to the same congruence class defines a complete fan. We prove that this fan is the normal fan of a polytope.
Recommendations
Cites work
- Algebraic and combinatorial structures on pairs of twin binary trees
- Associahedra via spines
- Brick polytopes, lattice quotients, and Hopf algebras
- Cambrian Hopf algebras
- Cambrian lattices.
- Discriminants, resultants, and multidimensional determinants
- Faces of generalized permutohedra
- Finite Coxeter groups and the weak order
- Hopf algebra of the planar binary trees
- Hyperplane arrangements with a lattice of regions
- Lattice and order properties of the poset of regions in a hyperplane arrangement
- Lattice congruences, fans and Hopf algebras.
- Lattice theory of the poset of regions
- Monoïdes préordonnés et chaînes de Malcev
- Noncrossing arc diagrams and canonical join representations
- Permutohedra, Associahedra, and Beyond
- Permutrees
- Polytopal Realizations of Generalized Associahedra
- Realization of the Stasheff polytope
- Realizations of the associahedron and cyclohedron
- Signed tree associahedra
- The algebra of binary search trees
- The brick polytope of a sorting network
- The Hopf algebra of diagonal rectangulations.
- Triangulations. Structures for algorithms and applications
Cited in
(29)- Combinatorial generation via permutation languages. II. Lattice congruences
- Congruence normality of simplicial hyperplane arrangements via oriented matroids
- Lattices from graph associahedra and subalgebras of the Malvenuto-Reutenauer algebra
- Removahedral congruences versus permutree congruences
- Lattices from graph associahedra
- Type cones of permutree fans
- Shard polytopes
- Stack-sorting for Coxeter groups
- scientific article; zbMATH DE number 3313455 (Why is no real title available?)
- Combinatorial generation via permutation languages. I: Fundamentals
- On flips in planar matchings
- Associahedra for finite‐type cluster algebras and minimal relations between g‐vectors
- Celebrating Loday's associahedron
- Combinatorial generation via permutation languages. III: Rectangulations
- Deformation cones of hypergraphic polytopes
- Shard Polytopes
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- The \(s\)-weak order and \(s\)-permutahedra. I: Combinatorics and lattice structure
- Rectangulotopes
- Shortest paths on polymatroids and hypergraphic polytopes
- Hochschild polytopes
- Combinatorics of rectangulations: old and new bijections
- Shuffles of deformed permutahedra, multiplihedra, constrainahedra, and biassociahedra
- Combinatorial generation via permutation languages. IV: Elimination trees
- Deformed graphical zonotopes
- Efficient generation of rectangulations via permutation languages
- Separating trees and simple congruences of the weak order
- Combinatorial generation via permutation languages. VII: Supersolvable hyperplane arrangements
- Pebble trees
This page was built for publication: Quotientopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968389)