Publications > Preprint server > Preprint Number 211
Preprint Number 211
211. L. Ciobanu, A. Ould Houcine
The monomorphism problem in free groups
Submission date: 27 October 2009.
Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if for any two elements u and v in F , there is an algorithm that 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 algorithm that solves the problem.
Mathematics Subject Classification: 20E05, 68Q25
Keywords and phrases: free groups, monomorphism problem, decision problems, complexity of algorithms.
|Last updated: December 14 2009 18:14||Please send your corrections to:|