arXiv · 2611.12329
Piercing a Chessboard with Restricted Slopes
Abstract
Is it true that for $n\geq 3$, $n-1$ lines are needed to pierce every cell of an $n\times n$ board? This problem was independently rediscovered several times: Alkauskas (1998), Harel-Ackerman-Pinchasi (2012, without claiming the $n-1$ bound), Bárány-Frankl (2021). However, apparently the first to pose it was T. Keller (Honolulu, Hawaii), in 1980, in the problem section of The American Mathematical Monthly. In this note, we give an affirmative answer to Keller's problem when all lines have slopes in $(-\infty,-1]\cup(0,1]$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Giedrius Alkauskas. 2026-11-09. Piercing a Chessboard with Restricted Slopes. https://searcharxiv.com/abs/2611.12329
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.