On Arnold's Problem on the Classifications of Convex Lattice Polytopes
@article{Zong2011OnAP, title={On Arnold's Problem on the Classifications of Convex Lattice Polytopes}, author={C. Zong}, journal={arXiv: Metric Geometry}, year={2011} }
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… Expand
3 Citations
Volumes of Convex Lattice Polytopes and A Question of V. I. Arnold
- Mathematics
- 2014
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 19 REFERENCES
Finite Groups of Matrices Whose Entries Are Integers
- Mathematics, Computer Science
- Am. Math. Mon.
- 2002
- 37