Related papers: Evaluating the Jones polynomial with tensor networ…
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…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a…
The Jones unknot conjecture states that the Jones polynomial distinguishes the unknot from nontrivial knots. We prove it for knots up to 23 crossings.
We reveal a relationship between the colored Jones polynomial and the A-polynomial for twist knots. We demonstrate that an asymptotics of the $N$-colored Jones polynomial in large $N$ gives the potential function, and that the A-polynomial…
We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that, assuming the Strong Slope conjecture, our characterization can be reformulated in terms of "Jones slopes" of knots and…
The working mathematician fears complicated words but loves pictures and diagrams. We thus give a no-fancy-anything picture rich glimpse into Khovanov's novel construction of `the categorification of the Jones polynomial'. For the same low…
Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduction from constrained counting to the problem of…
The statistical properties of random lattice knots, the topology of which is determined by the algebraic topological Jones-Kauffman invariants was studied by analytical and numerical methods. The Kauffman polynomial invariant of a random…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via…
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…
In the tensor-network framework, the expectation values of two-dimensional quantum states are evaluated by contracting a double-layer tensor network constructed from initial and final tensor-network states. The computational cost of…
In this article we shall give an account of certain developments in knot theory which followed upon the discovery of the Jones polynomial in 1984. The focus of our account will be recent glimmerings of understanding of the topological…
We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…
The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the…
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…
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…
We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several…
We estimate by Monte Carlo simulations the configurational entropy of $N$-steps polygons in the cubic lattice with fixed knot type. By collecting a rich statistics of configurations with very large values of $N$ we are able to analyse the…