Bounds on Area Involving Lattice Size
Jenya Soprunova

TL;DR
This paper establishes sharp lower bounds on the area of convex bodies in the plane based on their lattice size, improving previous bounds and classifying minimal polygons of fixed lattice size.
Contribution
It provides new sharp lower bounds on area involving lattice size and classifies minimal lattice polygons for fixed lattice size.
Findings
Improved bounds on area involving lattice size.
Classification of minimal lattice polygons.
Enhanced understanding of lattice polygon properties.
Abstract
The lattice size of a lattice polygon was introduced and studied by Schicho, and by Castryck and Cools in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an algebraic curve. In this paper we establish sharp lower bounds on the area of plane convex bodies that involve the lattice size of . In particular, we improve bounds established by Arnold, and B\'ar\'any and Pach. We also provide a classification of minimal lattice polygons of fixed lattice size .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Digital Image Processing Techniques
