On Cyclic Subgroups and the Conjugacy Problem

DOI10.2307/2042376zbMATH Open0401.20031OpenAlexW4245807727MaRDI QIDQ4185032FDOQ4185032

Authors: R. Daniel Hurwitz 

Publication date: 1980

Full work available at URL: https://eudml.org/doc/162829

zbMATH Keywords

Double Coset Solvability ProblemFree Products with AmalgamationPower Conjugacy ProblemSolvable Conjugacy Problem

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

• Generalization of Dehn's Result on the Conjugacy Problem
• Recursively enumerable degress and the conjugacy problem
• On the conjugacy problem in a free product with commuting subgroups
• 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
• Conjugate Powers in HNN Groups

Cited In (6)

• The conjugacy problem for Higman’s group
• The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups
• An Hnn-Extension with Cyclic Associated Subgroups and with Unsolvable Conjugacy Problem
• Model-theoretic and algorithmic questions in group theory
• The Conjugacy Problem for Graph Products with Cyclic Edge Groups
• The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups

This page was built for publication: On Cyclic Subgroups and the Conjugacy Problem

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