The monomorphism problem in free groups

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The monomorphism problem in free groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The monomorphism problem in free groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The monomorphism problem in free groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-619573

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.