2000 character limit reached
On the $N$-set occupancy problem
Published 15 Mar 2024 in math.CO and math.CA | (2403.10678v2)
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?
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.