Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
