In: Archiv der Mathematik, 2010, vol. 94, no. 5, p. 423-434
|
In: Archiv der Mathematik, 2010, vol. 94, no. 5, p. 423-434
Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if there is an algorithm such that, for any two elements u and v in F, it determines whether there exists a monomorphism of F that sends u to v. In this paper we show that the monomorphism problem is decidable and we provide an effective...
|
In: Transactions of the American Mathematical Society, 2009, vol. 361, no. 1, p. 223-236
Let G be a group that acts freely on a Λ -tree, where Λ is an ordered abelian group, and let ...
|