On the $N$-set occupancy problem
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910499339239424 |
|---|---|
| author | Demeter, Ciprian Zhang, Ruixiang |
| author_facet | Demeter, Ciprian Zhang, Ruixiang |
| contents | 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? |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_10678 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the $N$-set occupancy problem Demeter, Ciprian Zhang, Ruixiang Combinatorics Classical Analysis and ODEs 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? |
| title | On the $N$-set occupancy problem |
| topic | Combinatorics Classical Analysis and ODEs |
| url | https://arxiv.org/abs/2403.10678 |