Boundaries of pseudointegral polygons
Abstract
We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most 9 lattice points on its boundary, where a polygon P is called pseudointegral if the Ehrhart function of P is a polynomial. We further show that such a triangle never has exactly 7 lattice points on its boundary. Our results determine the set of all Ehrhart polynomials of rational triangles with one interior lattice point. In addition, we construct convex pseudointegral polygons with i interior lattice points and b boundary lattice points for all positive integral values of (i,b) such that b 5i + 4. This is in contrast to integral polygons, which must satisfy b 2i + 7 by a result of Scott. Our constructions yield many new Ehrhart polynomials of rational polygons in the i 2 case.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.