Root systems and graph associahedra
Abstract
It is known that a connected simple graph G associates a simple polytope PG called a graph associahedron in Euclidean space. In this paper we show that the set of facet vectors of PG forms a root system if and only if G is a cycle graph and that the root system is of type A.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.