2000 character limit reached
Root systems and graph associahedra (1602.03974v1)
Published 12 Feb 2016 in math.AT and math.CO
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.