On the conjugacy problem for knot groups

DOI10.1007/BF01237125zbMath0276.20033OpenAlexW4241254601MaRDI QIDQ1393606

Kenneth I. Appel

Publication date: 1974

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34) Word problems, etc. in computability and recursion theory (03D40)

Related Items (2)

GRAPH SMALL CANCELLATION THEORY APPLIED TO ALTERNATING LINK GROUPS ⋮ The conjugacy problem for groups of alternating prime tame links is polynomial-time

Cites Work

• On Dehn's algorithm
• On Dehn's algorithm and the conjugacy problem
• The word problem in fundamental groups of sufficiently large irreducible 3-manifolds
• The Word and Conjugacy Problems for the Knot Group of any Tame, Prime, Alternating Knot
• The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable
• Unnamed Item
• Unnamed Item

This page was built for publication: On the conjugacy problem for knot groups