On the N-set occupancy problem
Abstract
We explore variants of the following open question: Split [0,1]2 into N2 squares with side length 1/N. Is there a way to select N such squares such that each line intersects only O(1) of them?
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.