Coxeter Complexes and Graph-Associahedra
Quantum Algebra
2007-05-23 v2 Algebraic Geometry
Combinatorics
Abstract
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The geometric and combinatorial properties of the complex as well as of the polyhedra are given. These spaces are natural generalizations of the Deligne-Knudsen-Mumford compactification of the real moduli space of curves.
Keywords
Cite
@article{arxiv.math/0407229,
title = {Coxeter Complexes and Graph-Associahedra},
author = {Michael Carr and Satyan L. Devadoss},
journal= {arXiv preprint arXiv:math/0407229},
year = {2007}
}
Comments
18 pages, 9 figures; revised content and references