Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:14:27.641Z Has data issue: false hasContentIssue false

A congruence between link polynomials

Published online by Cambridge University Press:  24 October 2008

Lee Rudolph
Affiliation:
Department of Mathematics and Computer Science, Clark University, Worcester, Massachusetts 01610, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Throughout, ‘link’ means ‘oriented link in S3’, and ‘polynomial’ means ‘Laurent polynomial’. Let L be a link; then denotes the oriented polynomial of L (see [2, 8]), written in Morton's variables (see [5]), and denotes the semi-oriented polynomial of L (see [3]). Let L have components K1, …, Kn. The total linking of L, denoted t(L), is the sum of the linking numbers lk (Ki, Kj) with 1 ≤ i < j ≤ n. Let f be a framing of L (that is, f assigns an integer to each Ki); then f(L) denotes the total framing of L (that is, the sum of these integers), and A(L, f) denotes the naturally associated union of annuli embedded in S3 Define the framed polynomial {L, f} (v, z) to be (–1)n plus (v−1–v)z−1 times the sum, over all non-empty sublinks K of L, of (where K has k components with 1 ≤ k ≤ n).

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1990