arXiv · 1602.03974
Root systems and graph associahedra
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.
Explore related subjects
Keep this discovery
Miho Hatanaka. 2016-02-12. Root systems and graph associahedra. https://arxiv.org/abs/1602.03974
Cite the original work for its findings. Save a collection to share your selection of sources.