Bulletin of the London Mathematical Society Advance Access originally published online on February 24, 2009
Bulletin of the London Mathematical Society 2009 41(2):227-241; doi:10.1112/blms/bdn120
| ||||||||||||||||||||||||||||||||||||||||||||||||||
© 2009 London Mathematical Society
Regular lattice polytopes and root systems
Institut de Mathématiques et Modélisation de Montpellier
Université Montpellier 2
UMR CNRS 5149
Case Courrier 051
Place Eugène Bataillon
34095 Montpellier cedex
France
montagar@math.univ-montp2.fr
Received 15 June 2007. Revision received 1 October 2008.
Consider
, a lattice in a real finite-dimensional vector space. Here we are interested in lattice polytopes, that is, convex polytopes with vertices in
. Consider the group G of the affine real transformations that 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. In this paper, we associate to each regular lattice polytope a root system. This association allows us to give a new proof of the classification of regular lattice polytopes recently obtained by Karpenkov.
2000 Mathematics Subject Classification 52B20 (primary), 52B15, 51F15 (secondary).