Compressed words and automorphisms in fully residually free groups

Details Compressed words and automorphisms in fully residually free groups Compressed words and automorphisms in fully residually free groups

2009-08-05

arxiv.org/abs/0908.0569v3

Mathematics

Group Theory

Proof of Theorem 9 (now Theorem 10) clarified, improved notation. 13 pages

Scientific paper

We show that the compressed word problem in a finitely-generated fully
residually free group (F -group) is decidable in polynomial time, and use the
result to show that the word problem in the automorphism group of such a group
is decidable in polynomial time.

Affiliated with

Also associated with

No associations

Rating

Compressed words and automorphisms in fully residually 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 Compressed words and automorphisms in fully residually free groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed words and automorphisms in fully residually free groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254169