Search arXiv⌕ Search

arXiv · 2609.30409

Area stability of plank covers

Abstract

We prove a conjecture of András Bezdek on the stability of plank covers of the planar disk $D$. Namely, we show that if a sufficiently small concentric disk $rD$ is removed from $D$, then every finite family of planks covering the resulting annulus can be re-arranged to cover the whole disk. For the proof, we show a strong stability result for a related covering problem. If the hole has area $a \geq 0$ then the total overlap is $\geq c a/r$ where $c>0$ is a constant. This overlap estimate is not specific to the disk and is applicable to all planar symmetric convex bodies. We develop two new ingredients: a pruning procedure and a flattening mechanism.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Egor Bakaev, Amir Yehudayoff. 2026-09-24. Area stability of plank covers. https://arxiv.org/abs/2609.30409

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The semicontinuity of dimensions of measures

In this paper, we consider certain uniformity conditions on the radii of balls. Under these conditions, we study the semicontinuity of the Hausdorff dimension of measures with respect to measured Gromov--Hausdorff convergence and box convergence. We also examine the semicontinuity of other dimensions of measures, which are similar to the Hausdorff dimension of measures.

math.MG↗

A finite set with noncompact closed convex hull in a Hadamard space

We show that there is a Hadamard space in which the closed convex hull of a set containing merely three points is noncompact, by providing an AI-generated construction. The seemingly innocuous problem of finding a compact or finite set with this property, or showing that none exists, was recorded by Gromov and periodically revisited by researchers in metric geometry, functional analysis, fixed-point theory, and geometric group theory. Nevertheless, it remained unanswered for over three decades. The construction itself is based on building an inductive sequence of CAT(1) metric graphs and taking the Euclidean cone over the limiting space. We discuss the history of this problem, the main ideas and details of the construction, and its relationship with existing techniques.

math.MG↗

Metric foundations of geometry

A metric space is called all-set-homogeneous if every isometry between two of its subsets extends to an isometry of the whole space. We classify all-set-homogeneous geodesic spaces: besides the classical examples, they include the universal metric trees of finite valence. We also prove that every complete all-set-homogeneous length space is geodesic, and hence the same classification holds in this setting.

math.MG↗