Abstract

The lattice size of a lattice polygon $P$ is a combinatorial invariant of $P$ that was recently introduced 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 $P\subset\mathbb{R}^2$ that involve the lattice size of $P$. In particular, we improve bounds given by Arnold, and Bárány and Pach. We also provide a classification of minimal lattice polygons $P\subset\mathbb{R}^2$ of fixed lattice size ${\operatorname{ls_\square}}(P)$.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.