2001
DOI: 10.1142/4495
|View full text |Cite
|
Sign up to set email alerts
|

Introduction to Λ-Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 76 publications
(12 citation statements)
references
References 31 publications
0
12
0
Order By: Relevance
“…and by Lemma 2.1.4 in [8] we have that That is, [a, e a , e b , b] is a piecewise segment Proof. Follows from Lemma 2.4 and Lemma 2.5.…”
Section: 3mentioning
confidence: 91%
See 2 more Smart Citations
“…and by Lemma 2.1.4 in [8] we have that That is, [a, e a , e b , b] is a piecewise segment Proof. Follows from Lemma 2.4 and Lemma 2.5.…”
Section: 3mentioning
confidence: 91%
“…In an R-tree, [a, b] denotes the unique geodesic segment from a to b. Since metric structures are required to be based on complete metric spaces, it is a helpful fact that the completion of an R-tree is an R-tree (see [8,Lemma 2.4.14]).…”
Section: 3mentioning
confidence: 99%
See 1 more Smart Citation
“…Then it is easy to see that we may take w = ghz. It is impossible that both rules are of type (2), so assume one is of type (1) and the other is of type (2). There are two possibilities; the first is that the two rules have the form…”
Section: The Rewriting System Rmentioning
confidence: 99%
“…By a tree-free group we mean a group having an action on a -tree, for some (totally) ordered abelian group , which is free and without inversions. This means that every nonidentity element acts as a hyperbolic isometry (see [2,Chapter 3]). This paper arose from our efforts to verify some of the results in the paper of Alperin and Moss [1], one of the seminal papers on R-trees.…”
Section: Introductionmentioning
confidence: 99%