Compressed words and automorphisms in fully residually free groups
Group Theory
2009-10-21 v3
Abstract
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.
Cite
@article{arxiv.0908.0569,
title = {Compressed words and automorphisms in fully residually free groups},
author = {Jeremy Macdonald},
journal= {arXiv preprint arXiv:0908.0569},
year = {2009}
}
Comments
Proof of Theorem 9 (now Theorem 10) clarified, improved notation. 13 pages