Colorful graph associahedra
From MaRDI portal
Abstract: Given a graph G, the graph associahedron is a simple convex polytope whose face poset is based on the connected subgraphs of G. With the additional assignment of a color palette, we define the colorful graph associahedron, show it to be a collection of simple abstract polytopes, and explore its properties.
Recommendations
- Andrews-Gordon style identities
- Variants of the Andrews-Gordon identities
- New identities for Hall-Littlewood polynomials and applications
- Lattice paths, \(q\)-multinomials and two variants of the Andrews-Gordon identities
- Combinatorial properties of Rogers-Ramanujan type identities arising from Hall-Littlewood polynomials
Cited in
(16)- Marked tubes and the graph multiplihedron
- The Andrews-Gordon identities and \(q\)-multinomial coefficients
- A probabilistic proof of the Andrews--Gordon identities
- On certain identities involving Nahm-type sums with double poles
- Generalizing Nestohedra and graph associahedra for simple polytopes
- A generalization of Kawanaka's identity for Hall-Littlewood polynomials and applications
- Combinatorial properties of Rogers-Ramanujan type identities arising from Hall-Littlewood polynomials
- Colorful polytopes and graphs
- Convex polytopes from nested posets
- The Rogers-Ramanujan identities, the finite general linear groups, and the Hall-Littlewood polynomials
- Colorful associahedra and cyclohedra
- Pseudograph associahedra
- On the finitization of the Gordon identities
- Chromatic numbers for facet colouring of some generalised associahedra
- Tubings, chord diagrams, and Dyson-Schwinger equations
- Andrews-Gordon style identities
This page was built for publication: Colorful graph associahedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2112751)
