Chord diagrams, $d$-diagrams, and knots
Zapiski Nauchnykh Seminarov POMI, Geometry and topology. Part 5, Tome 267 (2000), pp. 170-194
Cet article a éte moissonné depuis la source Math-Net.Ru
A method of representing knots, links, and singular knots and links by means of words in a finite alphabet and so-called $d$-diagrams is given. Also a representation of the chord diagram algebra in terms of words in a finite alphabet is considered. This method, unlike coding by Gauss diagrams, allows to consider knots and links simultaneously. An algorithm for recognition diagrams of classical knots in the terms of $d$-diagrams is given.
@article{ZNSL_2000_267_a12,
author = {V. O. Manturov},
title = {Chord diagrams, $d$-diagrams, and knots},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {170--194},
year = {2000},
volume = {267},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2000_267_a12/}
}
V. O. Manturov. Chord diagrams, $d$-diagrams, and knots. Zapiski Nauchnykh Seminarov POMI, Geometry and topology. Part 5, Tome 267 (2000), pp. 170-194. http://geodesic.mathdoc.fr/item/ZNSL_2000_267_a12/