Related papers: An Efficient Algorithm to Compute the Colored Jone…

We consider the potential function of the colored Jones polynomial for a link with arbitrary colors and obtain the cone-manifold structure for the link complement. In addition, we establish a relationship between a saddle point equation and…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…

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…

We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how…

An important conjecture in knot theory relates the large-$N$, double scaling limit of the colored Jones polynomial $J_{K,N}(q)$ of a knot $K$ to the hyperbolic volume of the knot complement, $\text{Vol}(K)$. A less studied question is…

We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I…

The Conway potential function (CPF) for colored links is a convenient version of the multi-variable Alexander-Conway polynomial. We give a skein characterization of CPF, much simpler than the one by Murakami. In particular, Conway's…

We study the asymptotic behavior of the $N$-dimensional colored Jones polynomial of the figure-eight knot, evaluated at $\exp\bigl((u+2p\pi\sqrt{-1})/N\bigr)$ as $N$ tends to infinity, where $u>\operatorname{arccosh}(3/2)$ is a real number…

A sequence $f_n(q)$ is $q$-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in $q$ and $q^n$. Our main theorems state that $q$-holonomicity is preserved under twisting, i.e., replacing $q$ by $\omega q$…

It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model…

The Jones polynomial $V_{L}(t)$ for an oriented link $L$ is a one-variable Laurent polynomial link invariant discovered by Jones. For any integer $n\ge 3$, we show that: (1) the difference of Jones polynomials for two oriented links which…

In this paper we give a quantum statistical interpretation for the bracket polynomial state sum <K> and for the Jones polynomial. We use this quantum mechanical interpretation to give a new quantum algorithm for computing the Jones…

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…

This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…

Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We…

We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a…

The Kauffman-Vogel polynomials are three variable polynomial invariants of $4$-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented $4$-valent rigid vertex graphs was given by using the…

We construct geometrically a universal Jones invariant as a limit of invariants given by graded intersections in configuration spaces. For any fixed level $\mathscr N$, we define a new knot invariant, called ``$\mathscr N^{th}$ Unified…

The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…