Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the modular Jones polynomial

Published 3 Aug 2020 in math.CO | (2008.00716v1)

Abstract: A major problem in knot theory is to decide whether the Jones polynomial detects the unknot. In this paper we study a weaker related problem, namely whether the Jones polynomial reduced modulo an integer nn detects the unknot. The answer is known to be negative for n=2<sup>kn=2<sup>k with k≥1k\geq 1 and n=3n=3. Here we show that if the answer is negative for some nn, then it is negative for n<sup>kn<sup>k with any k≥1k\geq 1. In particular, for any k≥1k\geq 1, we construct nontrivial knots whose Jones polynomial is trivial modulo~$3k$.

Authors (1)

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.