Boundaries of pseudointegral polygons
Tyrrell B. McAllister, Jason S. Williford

TL;DR
This paper characterizes the boundary lattice points of rational pseudointegral triangles with one interior point, determines their Ehrhart polynomials, and constructs polygons with specific interior and boundary lattice point counts, expanding understanding of rational polygon Ehrhart theory.
Contribution
It proves bounds on boundary points of pseudointegral triangles with one interior point and constructs polygons with prescribed interior and boundary points, revealing new Ehrhart polynomial classes.
Findings
A rational pseudointegral triangle with one interior lattice point has at most 9 boundary points.
Such a triangle never has exactly 7 boundary lattice points.
Constructed polygons with all positive interior and boundary point counts satisfying b ≤ 5i + 4.
Abstract
We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most lattice points on its boundary, where a polygon is called pseudointegral if the Ehrhart function of is a polynomial. We further show that such a triangle never has exactly 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 interior lattice points and boundary lattice points for all positive integral values of such that . This is in contrast to integral polygons, which must satisfy by a result of Scott. Our constructions yield many new Ehrhart polynomials of rational polygons in the case.
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
TopicsAdvanced Numerical Analysis Techniques
