On a question of V.~I.~Arnol'd
\textit{V.~I.~Arnol'd} [Funct.\ Anal.\ Appl. 14, 79--81 (1980; Zbl 0447.52011)] asked how many distinct convex lattice polytopes with a given measure \(V\) are in \({\mathbb R}^d\), modulo lattice-preserving affine transformations. (For instance, in the plane, there is only one equivalence class with area 1/2, though it contains infinitely many triangles.) Work of the author with Pach and with Vershik established an upper bound of the form \(\exp (c V^{(d-1)/(d+1)})\). Here, a lower bound of the same form is obtained. Similar results are also obtained for centrally symmetric polytopes.
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
- Conditions for similarity to unitary and self-adjoint operators
- Dropping a vertex or a facet from a convex polytope
- On the Number of Convex Lattice Polygons
- Random points and lattice points in convex bodies
- The convex hull of the integer points in a large ball
- On the number of lattice free polytopes
- On the classification of convex lattice polytopes
- scientific article; zbMATH DE number 39688 (Why is no real title available?)
- On the Number of Convex Lattice Polygons
- scientific article; zbMATH DE number 2119472 (Why is no real title available?)
- On the classification of convex lattice polytopes. II
- A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
This page was built for publication: On a question of V.~I.~Arnol'd
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392026)