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

生成讲解博客的中文版本

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