D. Cherkashin

collaborators

Showing math.MGShow all

4 papers · 1 filter

math.MG2026

Universal Ahlfors--David regularity of Steiner trees

Danila Cherkashin, Pavel Prozorov, Yana Teplitskaya

The celebrated Steiner tree problem is the problem of finding a set $S t$ of minimum one-dimensional Hausdorff measure $H$ (length) such that $S t \cup A$ is connected, whe…

math.MG2025

On branching points in the Gilbert-Steiner problem

Danila Cherkashin

The Gilbert--Steiner problem is a generalization of the Steiner tree problem and specific optimal mass transportation, which allows the use additional (branching) point in a transp…

math.MG2025

Steiner trees with infinitely many terminals on the sides of an angle

Danila Cherkashin, Emanuele Paolini, Yana Teplitskaya

The Euclidean Steiner problem is the problem of finding a set $S t$ , with the shortest length, such that $S t \cup A$ is connected, where $A$ is a given set in a Euclidean space. The…

math.MG2025

An overview of maximal distance minimizers problem

Danila Cherkashin, Yana Teplitskaya

Consider a compact $M \subset R^{d}$ and $l > 0$ . A maximal distance minimizer problem is to find a connected compact set $I^£$ of the length (one-dimensional Hausdorff measu…