On the N-set occupancy problem

2024/03/15 by Ciprian Demeter, Ruixiang Zhang, Demeter, Ciprian +1 · 1 citation
Engineering · #Optimization and Packing Problems

paper · pdf · doi:10.48550/arxiv.2403.10678

Abstract

We explore variants of the following open question: Split [0,1]² into N² 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?

Cited by

• Random Constructions for Sharp Estimates of Mizohata-Takeuchi Type

Related

• Optimal Packings of 22 and 33 Unit Squares in a Square
• Reducing Moser's Square Packing Problem to a Bounded Number of Squares
• A note on the Erdős conjecture about square packing
• Perfectly packing a square by squares of sidelength f(n)^-t
• Slack-Pack algorithm for Meir-Moser packing problem