The conjugacy problem for finite graph products
The conjugacy problem for finite graph products
复制标题
有限图积的共轭问题
DOI：
--
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
K. Horadam
中科院分区：
文献类型：
--
作者：
K. Horadam;W. J. Wong;K. Horadam
有限图积是群的有限图的基本群。证明了具有有限循环边群的有限图积在一定条件下从其顶点群继承一个可解共轭问题，其中最重要的条件是每个顶点群中的所有边群生成元都是一个公共中心元的幂.
A finite graph product is the fundamental group of a finite graph of groups. Finite graph products with finite cyclic edge groups are shown to inherit a solvable conjugacy problem from their vertex groups under certain conditions, of which the most important is that all the edge group generators in each vertex group are powers of a common central element.