Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma

2024/09/23 by Aaron Abrams, Jamie Pommersheim, Abrams, Aaron +1
Computer Science · Engineering · Materials Science · Mathematics · #52B45 #52C05 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT) #Limits and Structures in Graph Theory #Quasicrystal Structures and Properties

paper · pdf · doi:10.48550/arxiv.2409.15178

openalex publication_date 2024/09/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.

Citations

• On Dividing A Square Into Triangles

Related

• Is there a smooth lattice polytope which does not have the integer decomposition property?
• Lattice Size of Plane Convex Bodies
• Lattice polygons and the number 2i+7
• Lattice Surfaces and smallest triangles
• Amicable Triangle and Rectangles on the Integer Lattice