Lattice Polytopes and Root Systems
| dc.creator | Ressayre, Nicolas | |
| dc.creator | Montagard, Pierre-Louis | |
| dc.date | 2006-09-28 | |
| dc.date.accessioned | 2026-07-07T07:25:24Z | |
| dc.date.available | 2026-07-07T07:25:24Z | |
| dc.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. | |
| dc.description | 14 pages, 1 Figure, 1 Table | |
| dc.identifier | https://arxiv.org/abs/math/0609809 | |
| dc.identifier | http://arxiv.org/abs/math/0609809 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116703 | |
| dc.subject | Combinatorics | |
| dc.subject | Algebraic Geometry | |
| dc.title | Lattice Polytopes and Root Systems | |
| dc.type | text |