The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。