Jones Polynomials and their Zeros for a Family of Knots and Links
arXiv:2507.03680 · doi:10.1007/s10955-025-03531-9
Abstract
We calculate Jones polynomials for a family of alternating knots and links with arbitrarily many crossings , by computing the Tutte polynomials for the associated graphs and evaluating these with and . Our method enables us to circumvent the generic feature that the computational complexity of for a knot or link for generic grows exponentially rapidly with . We also study the accumulation set of the zeros of these polynomials in the limit of infinitely many crossings, .
some typos fixed; matches published article