Regularity of maximum distance minimizers

DOI10.1007/S10958-018-3866-1zbMATH Open1396.49035arXiv1910.07630OpenAlexW2804781055WikidataQ129803061 ScholiaQ129803061MaRDI QIDQ1661545FDOQ1661545

Authors: Yana Teplitskaya 

Publication date: 16 August 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Abstract: We study the properties of sets $Sigma$ which are the solutions of the maximal distance minimizer problem, id est of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $Sigmasubsetmathbb{R}^2$ satisfying the inequality $ma{x}_{yinM}dist(y,Sigma)leqr$ for a given compact set $Msubsetmathbb{R}^2$ and some given $r>0$. Such sets can be considered as the shortest networks of radiating cables arriving to each customer (from the set $M$ of customers) at a distance at most $r$. In this work it is proved that each maximal distance minimizer is a union of finite number of simple curves, having one-sided tangents at each point. Moreover the angle between these rays at each point of a maximal distance minimizer is greater or equal to $2pi/3$. It shows that a maximal distance minimizer is isotopic to a finite Steiner tree even for a "bad" compact $M$, which differs it from a solution of the Steiner problem (there exists an example of a Steiner tree with an infinite number of branching points). Also we classify the behavior of a minimizer in a neighbourhood of an arbitrary point of $Sigma$. In fact, all the results are proved for more general class of local minimizer, id est sets which are optimal in a neighbourhood of its arbitrary point.

Full work available at URL: https://arxiv.org/abs/1910.07630

Recommendations

• On the horseshoe conjecture for maximal distance minimizers
• Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rⁿ
• The Steiner problem for infinitely many points
• Existence and regularity results for the Steiner problem
• On one-dimensional continua uniformly approximating planar sets

zbMATH Keywords

maximum distance minimizer

Mathematics Subject Classification ID

Regularity of solutions in optimal control (49N60) Infinite graphs (05C63) Optimization of shapes other than minimal surfaces (49Q10)

Cites Work

• On one-dimensional continua uniformly approximating planar sets
• Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rⁿ
• An example of an infinite Steiner tree connecting an uncountable set
• On the horseshoe conjecture for maximal distance minimizers

Cited In (3)

• Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rⁿ
• On the horseshoe conjecture for maximal distance minimizers
• Distance-regular \((0,\alpha)\)-reguli

This page was built for publication: Regularity of maximum distance minimizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661545)