Piercing the Chessboard
From MaRDI portal
Abstract: We consider the minimum number of lines and needed to intersect or pierce, respectively, all the cells of the chessboard. Determining these values can also be interpreted as a strengthening of the classical plank problem for integer points. Using the symmetric plank theorem of K. Ball, we prove that for each . Studying the piercing problem, we show that for , where the upper bound is conjectured to be sharp. The lower bound is proven by using the linear programming method, whose limitations are also demonstrated.
Recommendations
Cites work
- A Solution of the "Plank Problem"
- Cells in the box and a hyperplane
- Covering paths and trees for planar grids
- Covering paths for planar point sets
- Covering rectangles by few monotonous polyominoes
- Digital Straight Line Segments
- Discrete Representation of Straight Lines
- How (not) to cut your cheese
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 1436417 (Why is no real title available?)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- The plank problem for symmetric bodies
Cited in
(2)
This page was built for publication: Piercing the Chessboard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170442)