Mathematics – Group Theory
Scientific paper
2005-10-10
Geom. Topol. 9(2005) 1835-1880
Mathematics
Group Theory
Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol9/paper41.abs.html
Scientific paper
A finitely generated group admits a decomposition, called its Grushko
decomposition, into a free product of freely indecomposable groups. There is an
algorithm to construct the Grushko decomposition of a finite graph of finite
rank free groups. In particular, it is possible to decide if such a group is
free.
Diao Guo-An
Feighn Mark
No associations
LandOfFree
The Grushko decomposition of a finite graph of finite rank free groups: an algorithm 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 The Grushko decomposition of a finite graph of finite rank free groups: an algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Grushko decomposition of a finite graph of finite rank free groups: an algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-505928