Volume 9 (2005)

Download this article
For screen
For printing
Recent Issues

Volume 18 (2014)
Issue 1 1–616
Issue 2 617–1244

Volume 17 (2013) 1–5

Volume 16 (2012) 1–4

Volume 15 (2011) 1–4

Volume 14 (2010) 1–5

Volume 13 (2009) 1–5

Volume 12 (2008) 1–5

Volume 11 (2007)

Volume 10 (2006)

Volume 9 (2005)

Volume 8 (2004)

Volume 7 (2003)

Volume 6 (2002)

Volume 5 (2001)

Volume 4 (2000)

Volume 3 (1999)

Volume 2 (1998)

Volume 1 (1997)

G&T Monographs
The Journal
About the Journal
Editorial Board
Editorial Interests
Author Index
Editorial procedure
Submission Guidelines
Submission Page
Author copyright form
Subscriptions
Contacts
G&T Publications
GTP Author Index
ISSN (electronic): 1364-0380
ISSN (print): 1465-3060

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

DOI: 10.2140/gt.2005.9.1835

arXiv: math.GR/0510198

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

References
Forward citations
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

Authors
Guo-An Diao
School of Arts and Sciences
Holy Family University
Philadelphia
Pennsylvania 19114
USA
Mark Feighn
Department of Mathematics and Computer Science
Rutgers University
Newark
New Jersey 07102
USA