The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
Guo-An Diao, Mark Feighn
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.
Create a lesson
Related papers
The variety generated by all additively idempotent semirings of order four
Mengya Yue, Xiaolei Shao
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
Jiaping Lu
Kernel--wreath constructions and infinite families of finite simple skew braces
Marco Damele
Explicit equational bases for the power semirings of S7
Mengya Yue, Miaomiao Ren, Zidong Gao
The free multiplicative Lie algebra L(P) for a finitely generated parafree group P
Dessislava H. Kochloukova
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng