Table of Contents
Fetching ...

Universal Ahlfors--David regularity of Steiner trees

Danila Cherkashin, Pavel Pozorov, Yana Teplitskaya

TL;DR

The paper addresses the universal Ahlfors–David regularity of Steiner trees in $\mathbb{R}^d$, establishing that the trimmed Steiner set $\mathcal{S}t_\varepsilon$ is AD-regular with constants depending only on the ambient dimension $d$. By proving the crown-inequality $\frac{\mathcal{H}^1(\mathcal{S}t_\varepsilon \cap B_{\rho\varepsilon}(x))}{\varepsilon} \leq \left( \frac{64d}{1-\rho} \right)^{d-2}$ for all $x$, $\varepsilon$, and $\rho$, the authors derive a density-type bound on the number of segments inside balls, independent of the terminal set $\mathcal{A}$. The work builds on Paolini–Stepanov's existence and regularity framework, extends it with quantitative AD-regularity, and discusses planar refinements via a non-regular-example, Melzak-type reductions, and a coarea-based analysis. These results yield dimension-dependent, uniform regularity controls for Steiner trees and illuminate the geometric structure of finite versus general terminal configurations in high dimensions. The findings have potential implications for related one-dimensional minimization problems and Branched Optimal Transport.

Abstract

The celebrated Steiner tree problem is the problem of finding a set $\St$ of minimum one-dimensional Hausdorff measure $\H$ (length) such that $\St \cup \mathcal{A}$ is connected, where $\mathcal{A} \subset \mathbb{R}^d$ is a given compact set. Paolini and Stepanov provided very general existence and regularity results for the Steiner problem. Their main regularity result is that under a natural assumption, $\H(\St) < \infty$, for almost every $\varepsilon>0$ the set $\St_\varepsilon := \St\setminus B_\varepsilon(\mathcal A)$ is an embedded finite forest (acyclic graph). We give a quantitative regularity result by proving that the set $\St_\varepsilon$ is Ahlfors--David regular with constants that depend only on $d$ (and not on $\mathcal{A}$). Namely, for $d > 2$, every $\varepsilon > 0$, every $x \in \St_\varepsilon$, and every choice of $ρ\in (0,1)$, we have \[ \frac{\H(\St_\varepsilon \cap B_{ρ\varepsilon}(x))}{\varepsilon} \leq \left ( \frac{64d}{1-ρ} \right) ^{d-2}. \] As a corollary, we obtain a density-type result, i.e. that the set $\St_\varepsilon \cap B_{ρ\varepsilon}(x)$ consists of at most \[ \left ( \frac{64d}{1-ρ} \right) ^{d-1} \] line segments. In the plane (i.e., for $d=2$), it is possible to obtain tight structural results.

Universal Ahlfors--David regularity of Steiner trees

TL;DR

The paper addresses the universal Ahlfors–David regularity of Steiner trees in , establishing that the trimmed Steiner set is AD-regular with constants depending only on the ambient dimension . By proving the crown-inequality for all , , and , the authors derive a density-type bound on the number of segments inside balls, independent of the terminal set . The work builds on Paolini–Stepanov's existence and regularity framework, extends it with quantitative AD-regularity, and discusses planar refinements via a non-regular-example, Melzak-type reductions, and a coarea-based analysis. These results yield dimension-dependent, uniform regularity controls for Steiner trees and illuminate the geometric structure of finite versus general terminal configurations in high dimensions. The findings have potential implications for related one-dimensional minimization problems and Branched Optimal Transport.

Abstract

The celebrated Steiner tree problem is the problem of finding a set of minimum one-dimensional Hausdorff measure (length) such that is connected, where is a given compact set. Paolini and Stepanov provided very general existence and regularity results for the Steiner problem. Their main regularity result is that under a natural assumption, , for almost every the set is an embedded finite forest (acyclic graph). We give a quantitative regularity result by proving that the set is Ahlfors--David regular with constants that depend only on (and not on ). Namely, for , every , every , and every choice of , we have As a corollary, we obtain a density-type result, i.e. that the set consists of at most line segments. In the plane (i.e., for ), it is possible to obtain tight structural results.
Paper Structure (23 sections, 23 theorems, 55 equations, 4 figures)

This paper contains 23 sections, 23 theorems, 55 equations, 4 figures.

Key Result

Theorem 1

If $\mathcal{A}\subset \mathbb R^d$ is a compact set then there exists a Steiner set $\mathcal{S}t$ for $\mathcal{A}$. Moreover, if $\mathcal{S}t$ is a Steiner set for $\mathcal{A}$ and $\mathcal{H}^1(\mathcal{S}t)<+\infty$ then

Figures (4)

  • Figure 1: Example of a compact $\mathcal{A}$ that has a Steiner set of infinite length
  • Figure 2: Transition from $\mathcal{S}t_0$ to $\mathcal{S}t_1$
  • Figure 3: Transition from $\mathcal{S}t_{j-1}$ to $\mathcal{S}t_j$ in the neighborhood of a vertex $x \in P$
  • Figure 4: A tree with the same topology and symmetries as $\mathcal{S}t_4$

Theorems & Definitions (45)

  • Theorem 1: Paolini--Stepanov, 2013 paolini2013existence
  • Corollary 1
  • proof
  • Theorem 2
  • Corollary 2
  • Corollary 3
  • Definition 1: Ahlfors--David regularity
  • Example 1
  • proof
  • Definition 2: Ahlfors--David regularity of Steiner trees
  • ...and 35 more