The Jones polynomial of ribbon links

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

38 pages, reformatted in G&T style; minor changes suggested by the referee

Scientific paper

For every n-component ribbon link L we prove that the Jones polynomial V(L) is divisible by the polynomial V(O^n) of the trivial link. This integrality property allows us to define a generalized determinant det V(L) := [V(L)/V(O^n)]_(t=-1), for which we derive congruences reminiscent of the Arf invariant: every ribbon link L = (K_1,...,K_n) satisfies det V(L) = det(K_1) >... det(K_n) modulo 32, whence in particular det V(L) = 1 modulo 8. These results motivate to study the power series expansion V(L) = \sum_{k=0}^\infty d_k(L) h^k at t=-1, instead of t=1 as usual. We obtain a family of link invariants d_k(L), starting with the link determinant d_0(L) = det(L) obtained from a Seifert surface S spanning L. The invariants d_k(L) are not of finite type with respect to crossing changes of L, but they turn out to be of finite type with respect to band crossing changes of S. This discovery is the starting point of a theory of surface invariants of finite type, which promises to reconcile quantum invariants with the theory of Seifert surfaces, or more generally ribbon surfaces.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Jones polynomial of ribbon links does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Jones polynomial of ribbon links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Jones polynomial of ribbon links will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-247840

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.