The complexity and beauty of the Affine Plank Conjecture

Zaz Brown

Press space

Convex bodies

The Affine Plank Conjecture is about planks covering convex bodies.

A convex body is a shape with no inward curves, like the one shown in red on the leftbelow.

to make it convex.

Planks and relative width

A plank is a region between two parallel lines (or two parallel hyperplanes in higher dimensions).

A plank's relative width is its width divided by the width of the convex body, measured perpendicular to the plank.

40%

The Affine Plank Conjecture

In 1951 Thøger Bang conjectured that if planks cover a convex body, their relative widths must sum to at least 100%.

But nobody has been able to prove this for 75 years.

Three planks covering a convex body with total relative width 116% Three nonparallel planks cover an asymmetric convex body with rounded corners and flat sides, with a broad curve at the bottom-left corner. Purple, green, and red fills use multiply blending. Flat-ended dimension markers compare each plank with the body's width in the same direction. The only visible labels are 40%, 39%, and 37%, totaling 116%. Each fill and its borders share one gradual fade, ending at zero opacity on the dimension axis. Dotted supporting lines extend to the matching fade endpoint on the opposite side. 40% 39% 37%
40%+39%+37%=116%
Grab planks to , , and .

1 parameter

x position · w relative width · θ angle

Gap cells

We call the uncovered regions gap cells.

There are 8 possible gap cells.

The Affine Plank Conjecture is equivalent to saying that when the relative widths of the planks sum to less than one, there is always a gap cell with positive area.

Gap cells

Grab planks to , , and .
gi(x1, w1, θ1, x2, w2, θ2, x3, w3, θ3) is the area of gap i.

Each triple is a plank’s position, relative width, and angle.

% of triangle covered

    Solving the equations

    Grab planks to , , and .

    So all that remained was to set the area of every gap cell equal to zero and solve.

    As a computer scientist, I thought: finding an intersection of sets is easy.

    For finite sets, yes, but not so for sets of real numbers.

    For polynomial inequalities, a standard general method is cylindrical algebraic decomposition (CAD)…

    But its worst-case running time is doubly exponential in the number of variables, so the naive approach is not feasible, even on the triangle.

    3 planks