Concept

Finite type invariant

In the mathematical theory of knots, a finite type invariant, or Vassiliev invariant (so named after Victor Anatolyevich Vassiliev), is a knot invariant that can be extended (in a precise manner to be described) to an invariant of certain singular knots that vanishes on singular knots with m + 1 singularities and does not vanish on some singular knot with 'm' singularities. It is then said to be of type or order m. We give the combinatorial definition of finite type invariant due to Goussarov, and (independently) Joan Birman and Xiao-Song Lin. Let V be a knot invariant. Define V1 to be defined on a knot with one transverse singularity. Consider a knot K to be a smooth embedding of a circle into . Let K be a smooth immersion of a circle into with one transverse double point. Then where is obtained from K by resolving the double point by pushing up one strand above the other, and K_- is obtained similarly by pushing the opposite strand above the other. We can do this for maps with two transverse double points, three transverse double points, etc., by using the above relation. For V to be of finite type means precisely that there must be a positive integer m such that V vanishes on maps with transverse double points. Furthermore, note that there is notion of equivalence of knots with singularities being transverse double points and V should respect this equivalence. There is also a notion of finite type invariant for 3-manifolds. The simplest nontrivial Vassiliev invariant of knots is given by the coefficient of the quadratic term of the Alexander–Conway polynomial. It is an invariant of order two. Modulo two, it is equal to the Arf invariant. Any coefficient of the Kontsevich invariant is a finite type invariant. The Milnor invariants are finite type invariants of string links. Michael Polyak and Oleg Viro gave a description of the first nontrivial invariants of orders 2 and 3 by means of Gauss diagram representations. Mikhail N. Goussarov has proved that all Vassiliev invariants can be represented that way.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.