A self-similar infinite binary tree is a solution of Steiner problem

MaRDI QIDQ6425423zbMATH OpenFDO

Authors Dmitriy Cherkashin, Y. I. Teplitskaya

Publication date 4 February 2023

Abstract: We consider a general metric Steiner problem which is of finding a set $mathcalS$ with minimal length such that $mathcalScupA$ is connected, where $A$ is a given compact subset of a given complete metric space $X$; a solution is called Steiner tree. Paolini, Stepanov and Teplitskaya provided an example of a planar Steiner tree with an infinite number of branching points connecting an uncountable set of points. We prove that such a set can have a positive Hausdorff dimension which was an open question (the corresponding tree is a self-similar fractal).

This page was built for publication: A self-similar infinite binary tree is a solution of Steiner problem

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