English

Boundaries of pseudointegral polygons

Combinatorics 2025-01-14 v2

Abstract

We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most 99 lattice points on its boundary, where a polygon PP is called pseudointegral if the Ehrhart function of PP is a polynomial. We further show that such a triangle never has exactly 77 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 ii interior lattice points and bb boundary lattice points for all positive integral values of (i,b)(i,b) such that b5i+4b \le 5i + 4. This is in contrast to integral polygons, which must satisfy b2i+7b \le 2i + 7 by a result of Scott. Our constructions yield many new Ehrhart polynomials of rational polygons in the i2i \ge 2 case.

Keywords

Cite

@article{arxiv.2501.00667,
  title  = {Boundaries of pseudointegral polygons},
  author = {Tyrrell B. McAllister and Jason S. Williford},
  journal= {arXiv preprint arXiv:2501.00667},
  year   = {2025}
}

Comments

22 pages. Typos corrected and exposition improved

R2 v1 2026-06-28T20:53:41.762Z