The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups

DOI10.2307/2159376zbMath0749.20009OpenAlexW4244358261MaRDI QIDQ3987591

Jody Meyer Lockhart

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.2307/2159376

zbMATH Keywords

solvable generalized word problemgraph of groupssolvable conjugacy problemgraph products of groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups

Cites Work

• Unnamed Item
• 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

This page was built for publication: The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups