The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable

DOI10.2307/2038056zbMath0243.20036OpenAlexW4255909707MaRDI QIDQ5654237

Paul E. Schupp, Kenneth I. Appel

Publication date: 1972

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

Mathematics Subject Classification ID

Related Items (7)

A New Solution to the Word Problem in the Fundamental Groups of Alternating Knots and Links ⋮ On the conjugacy problem for knot groups ⋮ On mathematical contributions of Paul E. Schupp ⋮ Homotopically equivalent simple loops on 2-bridge spheres in 2-bridge link complements. I ⋮ The conjugacy problem for groups of alternating prime tame links is polynomial-time ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Rips-Segev torsion-free groups without the unique product property

Cites Work

• Unnamed Item
• On Dehn's algorithm
• On Dehn's algorithm and the conjugacy problem
• The Word and Conjugacy Problems for the Knot Group of any Tame, Prime, Alternating Knot

This page was built for publication: The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable