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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1835-1880 |
| Number of pages | 46 |
| Journal | Geometry and Topology |
| Volume | 9 |
| DOIs | |
| State | Published - Sep 25 2005 |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
Keywords
- Algorithm
- Graph of groups
- Grushko decomposition
- Labeled graph