Computing Vassiliev's invariants

Autor:	Theodore Stanford
Rok vydání:	1997
Předmět:	Knot complement Knots Pure mathematics Vassiliev invariants Quantum invariant Skein relation Knot polynomial Tricolorability Mathematics::Geometric Topology Finite type invariant Knot theory Combinatorics Knot invariant Geometry and Topology Algorithms Mathematics Knotted graphs
Zdroj:	Topology and its Applications. 77(3):261-276
ISSN:	0166-8641
DOI:	10.1016/s0166-8641(96)00121-6
Popis:	We give an explicit algorithm for computing all of Vassiliev's knot invariants of order ⩽ n, which has been implemented on a computer. In giving a justification of the algorithm, we obtain a simple proof of the sufficiency of the topological 1-term and 4-term relations. We use an example of Taniyama to show that two singular knot diagrams with the same configuration cannot always be made isotopic by crossing changes alone.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33fa09611e83d08774cb143bd0571b9e Zobrazit plný text záznamu Full Text from ScienceDirect