The optimal partial plank covering conjecture for convex bodies

Let KEdK\restriction\mathbb{E}^d be a convex body and let W>0W>0. A plank is a region between two parallel hyperplanes; its width is denoted by w(P)w(P). For a finite family of planks P1,,PnP_1,\ldots,P_n, suppose that

i=1nw(Pi)=W.\sum_{i=1}^n w(P_i)=W.

Optimal partial plank covering conjecture. There exists a plank PP of width WW such that, for every such finite family,

vold ⁣(Ki=1nPi)vold(KP).\operatorname{vol}_d\!\left(K\cap\bigcup_{i=1}^n P_i\right)\leq\operatorname{vol}_d(K\cap P).

This conjecture asserts that among all partial coverings of a convex body by planks with prescribed total width, a single plank is always optimal. It generalizes the affirmative result for Euclidean balls and the planar case described in the source, while the statement for arbitrary convex bodies and dimensions remains open.

Sources & referencesView supporting material

Primary source

Egor Bakaev and Alexander Polyanskii, “Optimal partial plank coverings”, arXiv:2607.27483 (2026).

Additional references

3 papers in this index state this conjecture (2011–2026). The statement above is taken from the most recent of them; the others are arXiv:2211.10886, arXiv:1106.5635.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.