On the horseshoe conjecture for maximal distance minimizers
Abstract
We study the properties of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets ⊂ R2 satisfying the inequality maxy ∈ M dist(y,) ≤ r for a given compact set M ⊂ R2 and some given r > 0. Such sets can be considered shortest possible pipelines arriving at a distance at most r to every point of M which in this case is considered as the set of customers of the pipeline. We prove the conjecture of Miranda, Paolini and Stepanov about the set of minimizers for M a circumference of radius R>0 for the case when r < R/4.98. Moreover we show that when M is a boundary of a smooth convex set with minimal radius of curvature R, then every minimizer has similar structure for r < R/5. Additionaly we prove a similar statement for local minimizers.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.