2025. 03. 28. 14:15 - 2025. 03. 28. 15:45
Rényi Intézet, Kutyás terem
-
-
Event type: seminar
Organizer: Institute
-
Budapest Big Combinatorics + Geometry Seminar

Description

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked whether the same statement holds if one is required to cover only the annulus obtained from $K$ by removing a homothetic copy contained within. He proved that if $K$ is the unit square, then saving width is not possible, provided the homothety factor is sufficiently small. White and Wisewell in 2006 characterized polygons that possess this property. We generalize their constructive result by showing that if $K$ is a convex disc or a convex body in 3-space, which is spiky in a minimal width direction, then for every $\varepsilon \in (0,1)$ it is possible to cut a homothetic copy $\varepsilon K$ from the interior of $K$ so that the remaining annulus can be covered by planks whose total width is strictly less than $w(K)$.

Joint work with Julian Huddell, Maggie Lai, Matthew Quirk, and Elias Williams.