Pick's theorem and sums of lattice points
Karl Levy, Melvyn B. Nathanson

TL;DR
This paper uses Pick's theorem to prove a property of lattice points in scaled sums of lattice polygons, showing that all lattice points in the h-fold sumset are sums of h lattice points in the original polygon.
Contribution
It provides a novel proof leveraging Pick's theorem to characterize lattice points in the sumsets of lattice polygons.
Findings
All lattice points in hP are sums of h lattice points in P.
The proof connects geometric properties with additive combinatorics.
The result applies to convex lattice polygons in the plane.
Abstract
Pick's theorem is used to prove that if is a lattice polygon (that is, the convex hull of a finite set of lattice points in the plane), then every lattice point in the -fold sumset is the sum of lattice points in .
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 · Advanced Graph Theory Research
