—HŠw•”ƒgƒ|ƒƒW[ƒZƒ~ƒi[@

A factorization of the Conway polynomial and covering linkage invariants

’Ë–{ ’B–ç Ž i‘ˆî“c‘åŠwj

‚TŒŽ‚Q‚O“úi–؁j@16:00 ~ 17:30

‘ˆî“c‘åŠw—HŠw•”i‘å‹v•ÛƒLƒƒƒ“ƒpƒXj‚T‚P†ŠÙ‚P‚WŠK‚P‚W|‚P‚Q‹³Žº

ŠT—vFJ.P. Levin showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the ƒÊ-invariants of the link. We show another description of the latter factor. Namely it is a determinant of a matrix whose entries are linking pairings in the infinite cyclic covering space of the knot complement. Moreover if the link admits a certain condition, the first non-vanishing coefficient of the Conway polynomial of the link is obtained. In fact the coefficient is determined by using an idea of derivation defined by T.D. Cochran.


¢˜blF@‘ºã@‡@i‘ˆî“c‘åŠw—HŠw•””—‰ÈŠw‰Èj

e-mail: murakami@waseda.jp