Lattice Polytopes and Root Systems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map the lattice onto itself. Replacing the group of euclidean motions by the group $G$ one can define the notion of regular lattice polytopes. More precisely, a lattice polytope is said to be regular if the subgroup of $G$ which preserves the polytope acts transitively on the set of its complete flags. Recently, Karpenkov obtained a classification of the regular lattice polytopes. Here we obtain this classification by a more conceptual method. Another difference is that Karpenkov uses in an essential way the classification of the euclidean regular polytopes, but we don't.
14 pages, 1 Figure, 1 Table

Keywords

Combinatorics, Algebraic Geometry

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/116703

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0609809
 http://arxiv.org/abs/math/0609809

Collections

arXiv