The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
复制标题
有限秩自由群的有限图的 Grushko 分解：一种算法
DOI：
10.2140/gt.2005.9.1835
复制
发表时间：
2005
影响因子：
2
通讯作者：
Mark Feighn
中科院分区：
文献类型：
--
作者：
Guo;Mark Feighn
一个群生成的群允许一个分解，称为它的Grushko分解，成为自由不可分解群的自由积。有一个算法来构造有限秩自由群的有限图的Grushko分解。特别是，可以确定这样的组是否是自由的。
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.