On regularity of maximal distance minimizers in Euclidean Space

Abstract

We study the properties of sets which are the solutions of the maximal distance minimizer problem, i.e. of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets ⊂ Rn satisfying the inequality \[ maxy ∈ M dist(y,) ≤ r \] for a given compact set M ⊂ Rn and some given r > 0. Such sets can be considered as the shortest networks of radiating Wi-Fi cables arriving to each customer (for the set M of customers) at a distance at most r. In this paper we prove that any maximal distance minimizer ⊂ Rn has at most 3 tangent rays at each point and the angle between any two tangent rays at the same point is at least 2π/3. Moreover, in the plane (for n=2) we show that the number of points with three tangent rays is finite and every maximal distance minimizer is a finite union of simple curves with one-sided tangents continuous from the corresponding side. All the results are proved for the more general class of local minimizers, i.e. sets which are optimal under a perturbation of a neighbourhood of their arbitrary point.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…