Equilateral n-gons in planar integer lattices
Abstract
We study the existence of equilateral polygons in planar integer lattices. Maehara showed that it's sufficient to work with rectangular lattices (m) = L[(1,0),(0,m)] with m 3 4. Building on results of Maehara and of Iino and Sakiyama, we show that for every such m there exists N such that for all n ≥ N, the lattice (m) contains an equilateral n-gon. This extends previous classifications of equilateral polygons in planar lattices.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.