The Conjugacy Problem for Graph Products with Cyclic Edge Groups

DOI10.2307/2043615zbMATH Open0477.20021OpenAlexW4241012461MaRDI QIDQ3934698FDOQ3934698

Authors: Kathy Horadam 

Publication date: 1983

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

zbMATH Keywords

conjugacy problemgraph productfree products with amalgamationfundamental group of a graph of groupsHNN groups

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• Title not available (Why is that?)
• The conjugacy problem for free products of sixth-groups with cyclic amalgamation
• The solvability of the conjugacy problem for certain HNN groups
• The conjugacy problem and cyclic amalgamations
• Title not available (Why is that?)
• On Cyclic Subgroups and the Conjugacy Problem
• Graphen ohne unendliche Wege
• Title not available (Why is that?)
• The Word Problem and Related Results for Graph Product Groups

Cited In (2)

• The conjugacy problem for Higman’s group
• The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3934698)