2000 character limit reached
Gromov-Hausdorff Geometry of Metric Trees
Published 25 Dec 2024 in math.MG | (2412.18888v1)
Abstract: In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is obtained. This result allows to construct a new class of shortest geodesics (in the proper class of all metric spaces) connecting such subset of a metric tree with the tree itself. In particular, the technique elaborated is demonstrated on subsets of the real line.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.