2004/07/31 by Olga Kharlampovich, Alexei Myasnikov
Mathematics · #math.GR #math.LO #msc:20F10 #msc:03C05
published as Cont. Math. AMS, Algorithms, Languages, Logic, CONM/378, 2005, 87-212 · 126 pages, 15 figures
arxiv created 2005/04/06 · arxiv updated 2009/12/01
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process correspond to cyclic splittings of the coordinate group of the initial system of equations. This allows us to construct algorithmically Grushko's decompositions of finitely generated fully residually free groups and cyclic [abelian] JSJ decompositions of freely indecomposable finitely generated fully residually free groups. We apply these results to obtain an effective description of the set of homomorphisms from a given finitely presented group into a free group, or, more generally, into an NTQ group.