Abstract
Abstract In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by several authors, upper bounds for the numbers of non-equivalent d-dimensional convex lattice polytopes of given volume or fixed number of lattice points have been achieved. In this paper, by introducing and studying the unimodular groups acting on convex lattice polytopes, we obtain a lower bound for the number of non-equivalent d-dimensional centrally symmetric convex lattice polytopes of given number of lattice points, which is essentially tight.
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.
