Root systems and graph associahedra

Miho Hatanaka

Root systems and graph associahedra

Algebraic Topology 2016-02-15 v1 Combinatorics

Authors: Miho Hatanaka

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.

Keywords

root systems polytopes

Cite

@article{arxiv.1602.03974,
  title  = {Root systems and graph associahedra},
  author = {Miho Hatanaka},
  journal= {arXiv preprint arXiv:1602.03974},
  year   = {2016}
}

Comments

3 pages, 3 figures

Related papers

View all related →