Home Mathematics On the classification of convex lattice polytopes
Article
Licensed
Unlicensed Requires Authentication

On the classification of convex lattice polytopes

  • Heling Liu and Chuanming Zong EMAIL logo
Published/Copyright: August 22, 2011
Become an author with De Gruyter Brill
Advances in Geometry
From the journal Volume 11 Issue 4

Abstract

In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its high dimensional analogue have been studied by Bárány, Pach, Vershik and others. Bounds for the number of non-equivalent d-dimensional convex lattice polytopes of given volume have been achieved. In this paper we study Arnold's problem for centrally symmetric lattice polygons and the classification problem for convex lattice polytopes of given cardinality. In the plane we obtain analogues to the bounds of Arnold, Bárány and Pach in both cases. However, the number of non-equivalent d-dimensional convex lattice polytopes of w lattice points is infinite whenever w – 1 ≥ d ≥ 3, which may intuitively contradict to Bárány and Vershik's upper bound.

Received: 2011-03-14
Published Online: 2011-08-22
Published in Print: 2011-November

© de Gruyter 2011

Downloaded on 13.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/advgeom.2011.031/html
Scroll to top button