Recent Issues |
|
Volume 1, 1997 |
|
Volume 2, 1998 |
|
Volume 3, 1999 |
|
Volume 4, 2000 |
|
Volume 5, 2001 |
|
Volume 6, 2002 |
|
Volume 7, 2003 |
|
Volume 8, 2004 |
|
Volume 9, 2005 |
|
Volume 10, 2006 |
|
Volume 11, 2007 |
|
Volume
12(1) 2008 |
|
Volume
12(2) 2008 |
|
Volume
12(3) 2008 |
|
Volume
12(4) 2008 |
|
Volume
12(5) 2008 |
|
Volume
13(1) 2009 |
|
Volume
13(2) 2009 |
|
Volume
13(3) 2009 |
|
Volume
13(4) 2009 |
|
Volume
13(5) 2009 |
|
Volume
14(2010) preview |
|
G&T Monographs |
|
|
|
The Grushko decomposition of a finite graph of finite rank
free groups: an algorithm
Guo-An Diao and Mark Feighn
|
|
Geometry & Topology 9 (2005)
1835–1880
|
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
graph of groups, Grushko decomposition,
algorithm, labeled graph
|
Mathematical Subject Classification
Primary: 20F65
Secondary: 20E05
|
Publication
Received: 5 February 2005
Revised: 11 September 2005
Accepted: 7 August 2005
Published: 25 September 2005
Proposed: Benson Farb
Seconded: Martin Bridson, Joan Birman
|
|
