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

Raeyong Kim
Additional contact information
Raeyong Kim: Department of Mathematics & Industrial Mathematics, College of Natural and Life Sciences, Daegu University, Gyeongsan 38453, Korea

Mathematics, 2021, vol. 9, issue 12, 1-8

Abstract: 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.

Keywords: high-dimensional graph manifolds; conjugacy problem; graph of groups (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/12/1330/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/12/1330/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:12:p:1330-:d:571658

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().