arXiv
Open Access
2024
On the $N$-set occupancy problem
Ciprian Demeter
Ruixiang Zhang
Abstrak
We explore variants of the following open question: Split $[0,1]^2$ into $N^2$ 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?
Penulis (2)
C
Ciprian Demeter
R
Ruixiang Zhang
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2024
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓