The monomorphism problem in free groups
Group Theory
2009-10-13 v1
Abstract
Let be a free group of finite rank. We say that the monomorphism problem in is decidable if for any two elements and in , there is an algorithm that determines whether there exists a monomorphism of that sends to . In this paper we show that the monomorphism problem is decidable and we provide an effective algorithm that solves the problem.
Cite
@article{arxiv.0910.1899,
title = {The monomorphism problem in free groups},
author = {Laura Ciobanu and Abderezak Ould Houcine},
journal= {arXiv preprint arXiv:0910.1899},
year = {2009}
}