Bounds on the number of vertices of sublattice-free lattice polygons
Abstract
In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures the existence of a sublattice point in the polygon. To obtain the bounds, we use relations between the number of edges of lattice broken lines and the coordinates of their endpoints.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.