An extremal property of lattice polygons

摘要

We find the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given square sublattice. As a tool, we prove Diophantine inequalities relating the number of edges of a broken line and the coordinates of its endpoints.