On convex lattice polygons
Reads0
Chats0
TLDR
In this paper, a convex lattice polygon with b boundary points and c (≥ 1) interior points is considered and it is shown that for any given c, the number b satisfies b ≤ 2c + 7, and identify the polygons for which equality holds.Abstract:
Let π be a convex lattice polygon with b boundary points and c (≥ 1) interior points. We show that for any given c, the number b satisfies b ≤ 2c + 7, and identify the polygons for which equality holds.read more
Citations
More filters
Book ChapterDOI
Modular Mahler Measures I
TL;DR: In this paper, the Mahler measure m(P k ) of certain polynomials P k was linked to special values of L-series of elliptic curves, to the Bloch-Beilinson conjectures.
Posted Content
Coefficients and roots of ehrhart polynomials
TL;DR: In this article, the Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of polytopes and the roots of these polynomials are investigated.
Journal ArticleDOI
Lattice vertex polytopes with interior lattice points.
TL;DR: In this paper, it was shown that for a convex polytope P CR, the largest possible / grows rapidly with D, even for K − 1 and K − 2.
Journal ArticleDOI
Lattice Polygons and the Number 12
TL;DR: This article discusses a theorem about polygons in the plane, which involves in an intriguing manner the number 12, and describes four proofs of the main theorem, but gives full details only for proof 4, which uses modular forms.