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 detects the unknot. The answer is known to be negative for with and . Here we show that if the answer is negative for some , then it is negative for with any . In particular, for any , we construct nontrivial knots whose Jones polynomial is trivial modulo~$3k$.
Paper Prompts
Sign up for free to create and run prompts on this paper.