Related papers: The Jones Polynomial from a Goeritz Matrix
We derive new formulas for the Jones polynomial and the Kauffman bracket polynomial of a rational link represented by a standard diagram that is not necessarily alternating. These formulas generalize the results of Qazaqzeh, Yasein, and…
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 construct a bigraded cohomology theory of links whose Euler characteristic is the Jones polynomial.
We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…
We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…
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…
M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is…
We recover the Jones polynomials of knots and links from the K-theory of a cluster C*-algebra of the sphere with two cusps. In particular, an interplay between the Chebyshev and Jones polynomials is studied.
Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…
We consider two Laurent polynomials in two variables associated to a braid, given by {\em graded intersections} between {\em fixed Lagrangians in configuration spaces}. In order to get link invariants, we notice that we have to quotient by…
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a…
This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…
In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…
We use Feynman diagrams to prove a formula for the Jones polynomial of a link derived recently by N.~Reshetikhin. This formula presents the colored Jones polynomial as an integral over the coadjoint orbits corresponding to the…
Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is…
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…
This expository essay is aimed at introducing the Jones polynomial. We will see the encapsulation of the Jones polynomial, which will involve topics in functional analysis and geometrical topology; making this essay an interdisciplinary…
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel…
Trivalent plane graphs are used in various areas of mathematics which relate for instance to the colored Jones polynomial, invariants of 3-manifolds and quantum computation. Their evaluation is based on computations in the Temperley-Lieb…