Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma
arXiv:2409.15178
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.
19 pages, 10 figures, 17 references