The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
classification
🧮 math.GR
keywords
decompositionfinitefreegroupsgrushkoalgorithmgraphgroup
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.