The Grushko decomposition of a finite graph of finite rank free groups: an algorithm

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.

Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol9/paper41.abs.html

References in corpus (2)

• Mapping tori of free group automorphisms are coherent
• Splittings of mapping tori of free group automorphisms

Cited by in corpus (6)

• One-ended subgroups of graphs of free groups with cyclic edge groups
• On the one-endedness of graphs of groups
• A Geometric Proof of the Structure Theorem for Cyclic Splittings of Free Groups
• Random graphs of free groups contain surface subgroups
• Detecting geometric splittings in finitely presented groups
• Vertex links and the Grushko decomposition