Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma
Combinatorics
2024-09-24 v1 Geometric Topology
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.
Cite
@article{arxiv.2409.15178,
title = {Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma},
author = {Aaron Abrams and Jamie Pommersheim},
journal= {arXiv preprint arXiv:2409.15178},
year = {2024}
}
Comments
19 pages, 10 figures, 17 references