Milnor numbers, Spanning Trees, and the Alexander-Conway Polynomial
Gregor Masbaum, Arkady Vaintrob
Abstract
We study relations between the Alexander-Conway polynomial ∇L and Milnor higher linking numbers of links from the point of view of finite-type (Vassiliev) invariants. We give a formula for the first non-vanishing coefficient of ∇L of an m-component link L all of whose Milnor numbers μi1... ip vanish for p n. We express this coefficient as a polynomial in Milnor numbers of L. Depending on whether the parity of n is odd or even, the terms in this polynomial correspond either to spanning trees in certain graphs or to decompositions of certain 3-graphs into pairs of spanning trees. Our results complement determinantal formulas of Traldi and Levine obtained by geometric methods.
Create a lesson
Related papers
Combinatorial Goussarov-Polyak-Viro Formulas for the Linking Number and Low Degree Coefficients of the Conway Polynomial
Nancy Scherich, Nathaniel Song
The flip symmetry on Khovanov-Rozansky homology
Hongjian Yang
Families of knots that cannot be made Legendrian parametrically
Javier Martínez-Aguinaga
Branched real projective structures on surfaces and geometrisation of representations
Gianluca Faraco, Nicholas Rungi
Generating the twist subgroup of the level 2 mapping class group of a non-orientable closed surface
Ryoma Kobayashi
H-cobordisms, infinite cyclic covers, and real Seiberg--Witten theory
Sungkyung Kang, JungHwan Park, Masaki Taniguchi