Papers
Topics
Authors
Recent
Search
2000 character limit reached

Shadows, ribbon surfaces, and quantum invariants

Published 23 Apr 2014 in math.GT | (1404.5983v2)

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

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.