Abstract
A complete ℝ-treeT will be constructed such that, for everyxσT, the cardinality of the set of connected components ofT{x} is the same and equals a pre-given cardinalityc; by this construction simultaneously the valuated matroid of the ends of this ℝ-tree is given. In addition, for any arbitrary ℝ-tree, an embedding into such a “universalc-tree” (for suitablec) will be constructed.
Similar content being viewed by others
References
A.W.M. Dress, Trees, tight extensions of metric spaces, and the cohomological dimension of certain grops: A note on combinatorial properties of metric spaces, Adv. Math.53 (1984) 321–402.
A.W.M. Dress, V.L. Moulton, and W.F. Tehalle, T-theory—an overview, Europ. J. Combin.17 (1996) 161–175.
A.W.M. Dress, and W.F. Terhalle, A combiatorial approach to σ-adc geometry, Part I: the process of completion, Geom. Dedicata46 (1993) 127–148.
A.W.M. Dress, and W.F. Terhalle, The real tree, Adv. Math.120 (1996) 283–301.
A.W.M. Dress, and W. Wenzel, Valuated matroids,. Adv. Math.93 (1992) 214–250.
W.F. Terhalle, Ein kombinatorischer Zugang zu &-adischer geometrie: bewertete matroide, Bäume und Gebäude, Diss., University Bielefeld, 1992.
W.F. Terhalle, ℝ-Trees and symmetric differences of sets, Europ. J. Combin., to apper.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Terhalle, W.F. Coordinatizing R-trees in terms of universal c-trees. Annals of Combinatorics 1, 183–196 (1997). https://doi.org/10.1007/BF02558474
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02558474