no. 16 · Tuesday 17 November 2026
An improved lower bound for piercing the chessboard by lines
Abstract
Let $p_n$ be the least number of lines meeting the interior of every cell of an $n\times n$ board. We prove that $\liminf_{n\to\infty}p_n/n\ge0.7520517>\frac34$. The previous bound was $0.7$. The proof is computer-assisted. It identifies a non-negative polynomial on the unit square and bounds its integral along every line.
- fields
- Combinatorics