2000 character limit reached
Triangulations of root polytopes
Published 19 Dec 2016 in math.CO | (1612.06143v1)
Abstract: Let $\Phi$ be an irreducible crystallographic root system and $\mathcal P$ its root polytope, i.e., its convex hull. We provide a uniform construction, for all root types, of a triangulation of the facets of $\mathcal P$. We also prove that, on each orbit of facets under the action of the Weyl gruop, the triangulation is unimodular with respect to a root sublattice that depends on the orbit.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.