Effective JSJ Decompositions

Details Effective JSJ Decompositions Effective JSJ Decompositions

2004-07-06

arxiv.org/abs/math/0407089v2

Cont. Math. AMS, Algorithms, Languages, Logic, CONM/378, 2005, 87-212

Mathematics

Group Theory

126 pages, 15 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Effective JSJ Decompositions 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 Effective JSJ Decompositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective JSJ Decompositions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-139815