MIT Combinatorics Seminar
Graphassociahedra
Satyan Devadoss
(Williams College)
http://www.williams.edu/Mathematics/devadoss/
Wednesday, November 17, 2004
4:15 pm Room 2338
ABSTRACT

The associahedron (or Stasheff polytope) is an object appearing in
numerous areas of mathematics, from homotopy theory (operads),
configuration spaces (particle collisions), statistics (phylogenetic
trees), geometric group theory (Coxeter complexes), and combinatorics.
Given any graph G, we construct a convex polytope based on G (dubbed the
graphassociahedra) with some elegant properties. For example, when G is
a path, we obtain the associahedron; when G is a cycle, we obtain the
cyclohedron. These polytopes appear naturally with respect to simplicial
Coxeter groups, and provide the tiling for certain compactified real
moduli spaces.


