GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Tarski's Plank Problem -- from Wolfram MathWorld

Search

Tarski's Plank Problem


Tarski's plank problem asks for the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed to cover a circular table of diameter 9 feet. Nine parallel planks suffice, but is there a covering using fewer planks if suitably oriented?

For the circular-table case, surface area on a sphere induces a measure on its equatorial disk for which the measure covered by a plank is at most a constant times its width (King 1994).

It was solved by an ingenious argument of Bang (1950, 1951).

More generally, a plank in Euclidean space is the closed region between two distinct parallel hyperplanes, and its width is their distance. Bang (1951) proved that planks covering a convex body have total width at least the minimum width of that body. Bakaev and Polyanskii (2026) extended this type of bound to a unit cube Q subset= R^d with d>=2 after removing the interior of a box H whose sides are parallel to those of Q. If the side lengths of H satisfy h_1+...+h_d=d-1, then every finite plank covering of Q\intH has total width at least 1, and the bound is sharp. The planar case gives a unit square with an axis-parallel square hole of side length 1/2. Bakaev and Polyanskii (2026) state that ChatGPT implemented their idea of applying Bang's lemma after an affine transformation of the coordinates.


See also

Cylinder Covering

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • Apollonian gasket
  • Apollonian network
  • 1000th twin prime

References

Aharoni, R.; Holzman, R.; Krivelevich, M.; and Meshulam, R. "Fractional Planks." Disc. Comput. Geom. 27, 585-602, 2002.Bakaev, E. and Polyanskii, A. "A Sharp Plank Theorem for Cube Annuli." 30 Oct 2026. https://arxiv.org/abs/2611.00379v1.Bang, T. "On Covering by Parallel-Strips." Mat. Tidsskr. B, 49-53, 1950.Bang, T. "A Solution to the 'Plank Problem.' " Proc. Amer. Math. Soc. 2, 990-993, 1951.King, J. L. "Three Problems in Search of a Measure." Amer. Math. Monthly 101, 609-628, 1994.Tarski, A. "Further Remarks about the Degree of Equivalence of Polygons." [Polish]. Odbitka Z. Parametru. 2, 310-314, 1932.

Referenced on Wolfram|Alpha

Tarski's Plank Problem

Cite this as:

Weisstein, Eric W. "Tarski's Plank Problem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TarskisPlankProblem.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.