English

On uniqueness in Steiner problem

Metric Geometry 2023-03-22 v3 Combinatorics

Abstract

We prove that the set of nn-point configurations for which the solution of the planar Steiner problem is not unique has the Hausdorff dimension at most 2n12n-1 (as a subset of R2n\mathbb{R}^{2n}). Moreover, we show that the Hausdorff dimension of the set of nn-point configurations on which at least two locally minimal trees have the same length is also at most 2n12n-1. Methods we use essentially require rely upon the theory of subanalytic sets developed in~\cite{bierstone1988semianalytic}. Motivated by this approach we develop a general setup for the similar problem of uniqueness of the Steiner tree where the Euclidean plane is replace by an arbitrary analytic Riemannian manifold MM. In this setup we argue that the set of configurations possessing two locally-minimal trees of the same length either has the dimension ndimM1n\dim M-1 or has a non-empty interior. We provide an example of a two-dimensional surface for which the last alternative holds. In addition to abovementioned results, we study the set of set of nn-point configurations for which there is a unique solution of the Steiner problem in Rd\mathbb{R}^d. We show that this set is path-connected.

Keywords

Cite

@article{arxiv.1809.01463,
  title  = {On uniqueness in Steiner problem},
  author = {Mikhail Basok and Danila Cherkashin and Nikita Rastegaev and Yana Teplitskaya},
  journal= {arXiv preprint arXiv:1809.01463},
  year   = {2023}
}
R2 v1 2026-06-23T03:54:59.202Z