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.
机构:
Universite Paul Sabatier, Lab E Picard, UMR 5580, F-31062 Toulouse, FranceUniversite Paul Sabatier, Lab E Picard, UMR 5580, F-31062 Toulouse, France