Milnor numbers, Spanning Trees, and the Alexander-Conway Polynomial

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…