Conjugacy Problem in the Fundamental Groups of High-Dimensional Graph Manifolds

Mathematics

Raeyong Kim¹ 

[1] Department of Mathematics & Industrial Mathematics, College of Natural and Life Sciences, Daegu University, Gyeongsan 38453, Korea;

关键词: high-dimensional graph manifolds;    conjugacy problem;    graph of groups;   

DOI  :  10.3390/math9121330

来源: DOAJ

【 摘 要 】

The conjugacy problem for a group G is one of the important algorithmic problems deciding whether or not two elements in G are conjugate to each other. In this paper, we analyze the graph of group structure for the fundamental group of a high-dimensional graph manifold and study the conjugacy problem. We also provide a new proof for the solvable word problem.

【 授权许可】

Unknown