2008
DOI: 10.1007/s00209-008-0431-5
|View full text |Cite
|
Sign up to set email alerts
|

Uniformly continuous maps between ends of $${\mathbb{R}}$$ -trees

Abstract: There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of categories and comes from considering the end space of the tree. In this equivalence, uniformly continuous maps between the end spaces are translated to some classes of coarse maps (or even classes of metrically proper Lipschitz maps) between the trees.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 12 publications
0
16
0
Order By: Relevance
“…For more background on R-trees, see Bestvina [6], Chiswell [13], and Morgan and Shalen [35]. For more information and references on end spaces of R-trees, see Hughes [26] and Martínez-Pérez and Morón [33].…”
Section: Recollections On Trees and Their Endsmentioning
confidence: 99%
“…For more background on R-trees, see Bestvina [6], Chiswell [13], and Morgan and Shalen [35]. For more information and references on end spaces of R-trees, see Hughes [26] and Martínez-Pérez and Morón [33].…”
Section: Recollections On Trees and Their Endsmentioning
confidence: 99%
“…By choosing a root on an R-tree the boundary at infinity naturally becomes a complete ultrametric space. In fact, several categorical equivalences are proved in the literature, see [10] and [15]. Further equivalences may be found in [11].…”
Section: Hyperbolic Approximationmentioning
confidence: 96%
“…If d(v 0 , z) ≤ d(v 1 , z) the vertices u 0 , u 1 hold that d(u 0 , v 0 ) ≤ d(u 0 , v 1 ) and d(u 1 , v 0 ) ≤ d(u 1 , v 1 ) but this last inequality is not possible because there is a geodesic segment from x to u 1 containing v 1 (restriction of γ 1 ) and since Lemma 5. 16. Let x ∈ A ε , {y 1 , · · · , y n } = ∂B(x, ε) ∩ cl(X\B(x, ε)) the partition defined in Lemma 5.13.…”
Section: Finite Graphsmentioning
confidence: 99%