The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups
From MaRDI portal
Publication:3987591
DOI10.2307/2159376zbMath0749.20009MaRDI QIDQ3987591
Publication date: 28 June 1992
Full work available at URL: https://doi.org/10.2307/2159376
solvable generalized word problem; graph of groups; solvable conjugacy problem; graph products of groups
20F05: Generators, relations, and presentations of 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
Cites Work
- An Hnn-Extension with Cyclic Associated Subgroups and with Unsolvable Conjugacy Problem
- The conjugacy problem and cyclic amalgamations
- On Cyclic Subgroups and the Conjugacy Problem
- The Conjugacy Problem for Finite Graph Products
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups
- Unnamed Item