The conjugacy problem for groups of alternating prime tame links is polynomial-time

DOI10.1090/S0002-9947-97-01617-6zbMath0884.57010OpenAlexW1595615582MaRDI QIDQ3127567

Karin Johnsgard

Publication date: 9 April 1997

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-97-01617-6

zbMATH Keywords

knotconjugacy problemlink groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General low-dimensional topology (57M99) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

GRAPH SMALL CANCELLATION THEORY APPLIED TO ALTERNATING LINK GROUPS, Homotopically equivalent simple loops on 2-bridge spheres in 2-bridge link complements. I, THE GEOMETRY OF THE DEHN COMPLEX FOR A SPATIAL GRAPH, A particle finite element method applied to long wave run-up

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closed incompressible surfaces in alternating knot and link complements
• Small cancellation theory and automatic groups
• On Dehn's lemma and the asphericity of knots
• Artin groups and infinite Coxeter groups
• Small cancellation theory and automatic groups. II
• On the conjugacy problem for knot groups
• The conjugacy problem for knot groups
• 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