Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma
Preprint
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.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Foldable Triangulations of Lattice PolygonsThe American Mathematical Monthly, 2014
- On equidissection of balanced polygonsJournal of Mathematical Sciences, 2013
- Neuer beweis für die invarianz der dimensionszahl und des gebietesAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1928