Abstract
Eisermann has shown that the Jones polynomial of a -component ribbon link is divided by the Jones polynomial of the trivial -component link. We improve this theorem by extending its range of application from links in to colored knotted trivalent graphs in , the connected sum of copies of . We show in particular that if the Kauffman bracket of a knot in has a pole in of order , the ribbon genus of the knot is at least . We construct some families of knots in for which this lower bound is sharp and arbitrarily big. We prove these estimates using Turaev shadows.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.