Marked tubes and the graph multiplihedron
arXiv:0807.4159 · doi:10.2140/agt.2008.8.2081
Abstract
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of the multiphihedron, but features of this polytope appear in works related to quilted disks, bordered Riemann surfaces, and operadic structures. Certain examples of graph multiplihedra are related to Minkowski sums of simplices and cubes and others to the permutohedron.
23 pages, 17 figures
References in corpus (3)
Cited by in corpus (9)
- Geometric combinatorial algebras: cyclohedron and simplex
- Celebrating Loday's Associahedron
- The minimal model for the Batalin-Vilkovisky operad
- Shuffles of deformed permutahedra, multiplihedra, constrainahedra, and biassociahedra
- Shuffles and Concatenations in Constructing of Graphs
- Species substitution, graph suspension, and graded Hopf algebras of painted tree polytopes
- Lifted generalized permutahedra and composition polynomials
- Gromov-Witten Theory of P^1xP^1xP^1
- New Hopf Structures on Binary Trees (Extended Abstract)