Recognition algorithms in knot theory
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 58 (2003) no. 6, pp. 1093-1139
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper the problem of constructing algorithms for comparing knots and links is discussed. A survey of existing approaches and basic results in this area is given. In particular, diverse
combinatorial methods for representing links are discussed, the Haken algorithm for recognizing a trivial knot (the unknot) and a scheme for constructing a general algorithm (using Haken's ideas) for comparing links are presented, an approach based on representing links by closed braids is described, the known algorithms for solving the word problem and the conjugacy problem for braid groups are described, and the complexity of the algorithms under consideration is discussed. A new method of combinatorial description of knots is given together
with a new algorithm (based on this description) for recognizing the unknot by using a procedure for monotone simplification. In the conclusion of the paper several problems are formulated whose solution could help to advance towards the “algorithmization” of knot theory.
@article{RM_2003_58_6_a1,
author = {I. A. Dynnikov},
title = {Recognition algorithms in knot theory},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {1093--1139},
publisher = {mathdoc},
volume = {58},
number = {6},
year = {2003},
language = {en},
url = {http://geodesic.mathdoc.fr/item/RM_2003_58_6_a1/}
}
I. A. Dynnikov. Recognition algorithms in knot theory. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 58 (2003) no. 6, pp. 1093-1139. http://geodesic.mathdoc.fr/item/RM_2003_58_6_a1/