Generalizing Nestohedra and graph associahedra for simple polytopes
zbMath1447.52017MaRDI QIDQ2199837
Publication date: 14 September 2020
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//45.html
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polyhedra and polytopes; regular figures, division of spaces (51M20) Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Faces of generalized permutohedra
- A realization of graph associahedra
- Marked tubes and the graph multiplihedron
- Coxeter-bicatalan combinatorics
- Incidence combinatorics of resolutions
- On stretching the interval simplex-permutohedron
- Coxeter complexes and graph-associahedra
- Permutohedra, Associahedra, and Beyond
- Generalized associahedra via quiver representations
- Combinatorial Realization of the Hopf Algebra of Sashes
This page was built for publication: Generalizing Nestohedra and graph associahedra for simple polytopes
