加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本