The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
Group Theory
2014-11-11 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0510198,
title = {The Grushko decomposition of a finite graph of finite rank free groups: an algorithm},
author = {Guo-An Diao and Mark Feighn},
journal= {arXiv preprint arXiv:math/0510198},
year = {2014}
}
Comments
Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol9/paper41.abs.html