Related papers: Recurrence relation for Jones polynomials
We give an explicit formula for the Jones polynomial of any rational link in terms of the denominators of the canonical continued fraction of the slope of the given rational link.
We investigate coincidences of the (one-variable) Jones polynomial amongst rational knots, what we call `Jones rational coincidences'. We provide moves on the continued fraction expansion of the associated rational which we prove do not…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…
We utilize the trip matrix method of calculating the Jones Polynomial to give an alternative proof that the Jones Polynomial is multiplicative under connect sums.
Measuring the entanglement complexity of collections of open curves in 3-space has been an intractable, yet pressing mathematical problem, relevant to a plethora of physical systems, such as in polymers and biopolymers. In this manuscript,…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
In this paper, a method is given to calculate the Jones polynomial of the 6-plat presentations of knots by using a representation of the braid group $\mathbb{B}_6$ into a group of $5\times 5$ matrices. We also can calculate the Jones…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
We give an alternate expansion of the colored Jones polynomial of pretzel links which recovers the degree formula in arXiv:1807.00957. As an application, we determine the degrees of the colored Jones polynomials of a new family of 3-tangle…
We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete…
We give a topological formula of the loop expansion of the colored Jones polynomials by using identification of generic quantum sl2 representation with homological representations. This gives a direct topological proof of the…
In 2012, Cohen, Dasbach, and Russell presented an algorithm to construct a weighted adjacency matrix for a given knot diagram. In the case of pretzel knots, it is shown that after evaluation, the determinant of the matrix recovers the Jones…
This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the…
Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and…
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…
Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…