Root systems and graph associahedra

Publication date 12 February 2016

Abstract: It is known that a connected simple graph

G

associates a simple polytope

P_{G}

called a graph associahedron in Euclidean space. In this paper we show that the set of facet vectors of

P_{G}

forms a root system if and only if

G

is a cycle graph and that the root system is of type A.

This page was built for publication: Root systems and graph associahedra