arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.0569math.GR
收藏

Compressed words and automorphisms in fully residually free groups

Jeremy Macdonald

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑