The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups
From MaRDI portal
Publication:4750852
DOI10.2307/2045299zbMath0512.20018MaRDI QIDQ4750852
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2045299
free products with amalgamation; HNN extensions; conjugacy problem; fundamental group of graph of groups; graph products with cyclic edge groups
20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
The Conjugacy Problem for Finite Graph Products, The Conjugacy Problem for HNN Extensions with Infinite Cyclic Associated Groups, The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups
Cites Work
- Unnamed Item
- Unnamed Item
- The Word Problem and Related Results for Graph Product Groups
- The Conjugacy Problem for Graph Products with Cyclic Edge Groups
- The solvability of the conjugacy problem for certain HNN groups
- The conjugacy problem and cyclic amalgamations
- Conjugate Powers in HNN Groups
- On Cyclic Subgroups and the Conjugacy Problem
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)