An Unexpected Class of 5+gon-free Line Patterns
Abstract
Let S be a finite subset of R2 (0,0). Generally, one would expect the pattern of lines Ax + By = 1, where (A, B) ∈ S to contain polygons of all shapes and sizes. We show, however, that when S is a rectangular subset of the integer lattice or a closely related set, no polygons with more than 4 sides occur. In the process, we develop a general theorem that explains how to find the next side as one travels around the boundary of a cell.
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.