Cube-annulus plank-covering conjecture
For every integer , let and let . Is it true that every collection of planks whose union covers the cube annulus satisfies whenever ?
References
- On plank coverings of cube annuli — arXiv — Gergely Ambrus, Matthew Corbo, Dakota Nobuyuki Goto, Desmond Leitz, Kai Mawhinney
Source: arXiv
Progress summary
A new result extends the range where the conjectured covering lower bound is known in dimensions two and three, but the full conjecture remains open.
The conjecture asks whether the cube annulus always requires planks with total width at least the cube’s minimal width below the conjectured threshold. Bezdek introduced this annulus variant in 2003.
Known results
- Squares: the expected lower bound holds for (Bezdek, 2003).
- Unit -dimensional cubes: the square result was extended in 2010 (Smurov, Bogataya, and Bogatyi).
October 2026 advance
On October 13, 2026, Gergely Ambrus, Matthew Corbo, Dakota Nobuyuki Goto, Desmond Leitz, and Kai Mawhinney reported that the conjectured lower bound remains valid for , with , in dimensions and . This narrows the gap but does not settle the full conjecture; the advance is unverified here.
Current status (as of October 2026): The conjecture has a claimed partial advance for and , while the full statement remains open and the advance has not been independently verified.
Solutions 0
No solutions have been posted yet.