On Arnold's Problem on the Classifications of Convex Lattice Polytopes

Details On Arnold's Problem on the Classifications of Convex Lattice Polytopes On Arnold's Problem on the Classifications of Convex Lattice Polytopes

2011-07-14

arxiv.org/abs/1107.2966v1

Mathematics

Metric Geometry

18 pages, 3 figures

Scientific paper

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 B'ar'any, Pach, Vershik, Liu, Zong and others. Upper bounds for the numbers of non-equivalent ddimensional convex lattice polytopes of given volume or cardinality have been achieved. In this paper, by introducing and studying the unimodular groups acting on convex lattice polytopes, we obtain lower bounds for the number of non-equivalent d-dimensional convex lattice polytopes of bounded volume or given cardinality, which are essentially tight.

Affiliated with

Also associated with

No associations

Rating

On Arnold's Problem on the Classifications of Convex Lattice Polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Arnold's Problem on the Classifications of Convex Lattice Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Arnold's Problem on the Classifications of Convex Lattice Polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225713