Geodesic
Finitely Presented Groups and Semigroups in Knot Theory
Informatics and Automation, Dynamical systems, automata, and infinite groups, Tome 231 (2000), pp. 231-248

Voir la notice de l'article provenant de la source Math-Net.Ru

We construct finitely presented semigroups whose central elements are in one-to-one correspondence with the isotopy classes of non-oriented links in $\mathbb R^3$. Solving the word problem for those semigroups is equivalent to solving the classification problem for links and tangles. Also, we give a construction of finitely presented groups containing the braid group as a subgroup. 
@article{TRSPY_2000_231_a7,
     author = {I. A. Dynnikov},
     title = {Finitely {Presented} {Groups} and {Semigroups} in {Knot} {Theory}},
     journal = {Informatics and Automation},
     pages = {231--248},
     publisher = {mathdoc},
     volume = {231},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2000_231_a7/}
}
TY  - JOUR
AU  - I. A. Dynnikov
TI  - Finitely Presented Groups and Semigroups in Knot Theory
JO  - Informatics and Automation
PY  - 2000
SP  - 231
EP  - 248
VL  - 231
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2000_231_a7/
LA  - ru
ID  - TRSPY_2000_231_a7
ER  - 
%0 Journal Article
%A I. A. Dynnikov
%T Finitely Presented Groups and Semigroups in Knot Theory
%J Informatics and Automation
%D 2000
%P 231-248
%V 231
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2000_231_a7/
%G ru
%F TRSPY_2000_231_a7
I. A. Dynnikov. Finitely Presented Groups and Semigroups in Knot Theory. Informatics and Automation, Dynamical systems, automata, and infinite groups, Tome 231 (2000), pp. 231-248. http://geodesic.mathdoc.fr/item/TRSPY_2000_231_a7/