pith. sign in

arxiv: 0904.1527 · v1 · pith:P62D3JQ6new · submitted 2009-04-09 · 🧮 math.GT

Characterization of Finite Type String Link Invariants of Degree < 5

classification 🧮 math.GT
keywords invariantsstringdegreefinitetypelinkcharacterizationgive
0
0 comments X
read the original abstract

In this paper, we give a complete set of finite type string link invariants of degree <5. In addition to Milnor invariants, these include several string link invariants constructed by evaluating knot invariants on certain closure of (cabled) string links. We show that finite type invariants classify string links up to C_k-moves for k<6, which proves, at low degree, a conjecture due to Goussarov and Habiro. We also give a similar characterization of finite type concordance invariants of degree <6.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.