Shadows, ribbon surfaces, and quantum invariants

preprint2015arXivOpen access

Abstract

Eisermann has shown that the Jones polynomial of a nn-component ribbon link L⊂S3L\subset S^3 is divided by the Jones polynomial of the trivial nn-component link. We improve this theorem by extending its range of application from links in S3S^3 to colored knotted trivalent graphs in #g(S2×S1)\#_g(S^2\times S^1), the connected sum of g⩾0g\geqslant 0 copies of S2×S1S^2\times S^1. We show in particular that if the Kauffman bracket of a knot in #g(S2×S1)\#_g(S^2\times S^1) has a pole in q=iq=i of order nn, the ribbon genus of the knot is at least n+12\frac {n+1}2. We construct some families of knots in #g(S2×S1)\#_g(S^2\times S^1) for which this lower bound is sharp and arbitrarily big. We prove these estimates using Turaev shadows.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.