Plank theorems and their applications: a survey
William Verreault
TL;DR
The survey collects a broad tapestry of plank problems, starting from Tarski's foundational question on coverings by planks and Bang's subsequent solution, and then moves through Ball's plank theorem for symmetric convex bodies to a spectrum of complex, spherical, and polynomial analogues. It highlights unifying methods—Bang's lemma, linear-algebraic reductions, and the polynomial approach—that yield sharp bounds and enable extensions to infinite-dimensional settings and diverse spaces. The work then links plank theorems to deep applications in analysis (polarization constants, uniform boundedness, dynamics), harmonic analysis (Nazarov-type coefficient problems), and number theory (Diophantine approximation, sphere packings), illustrating the cross-pollination of discrete-geometry ideas with analytic and number-theoretic techniques. Overall, the paper demonstrates that lower bounds for plank coverings not only solve geometric questions but also drive substantive advances across multiple mathematical disciplines, often via translation of geometric constraints into algebraic, analytic, or combinatorial frameworks.
Abstract
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems in various areas of mathematics.
