A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem
Fractal and Fractional · 20.05.2023 · 7 (5) · 414
DOI: 10.3390/fractalfract7050414 ↗Kurz gefasst
Fachartikel in der Zeitschrift Fractal and Fractional, online erschienen am 20.05.2023. Verfasst von Danila Cherkashin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 10 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Education and Science of Bulgaria, Simons Foundation.
Abstract (Originalsprache)
We consider a general metric Steiner problem, which involves finding a set S with the minimal length, such that S∪A is connected, where A is a given compact subset of a given complete metric space X; a solution is called the Steiner tree. Paolini, Stepanov, and Teplitskaya in 2015 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 exhibits self-similar fractal properties).
Förderung
- Ministry of Education and Science of Bulgaria
- Simons Foundation
Zitieren
APA
Cherkashin, D., & Teplitskaya, Y. (2023). A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem. Fractal and Fractional, 7(5), 414. https://doi.org/10.3390/fractalfract7050414
Vancouver
Cherkashin D, Teplitskaya Y. A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem. Fractal and Fractional. 2023;7(5):414. doi:10.3390/fractalfract7050414
BibTeX
@article{Cherkashin2023,
author = {Cherkashin, Danila and Teplitskaya, Yana},
title = {A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem},
journal = {Fractal and Fractional},
year = {2023},
volume = {7},
number = {5},
pages = {414},
doi = {10.3390/fractalfract7050414}
}
EUVIMED