Related papers: A parallel algorithm for the computation of the Jo…

It has been argued based on electric-magnetic duality and other ingredients that the Jones polynomial of a knot in three dimensions can be computed by counting the solutions of certain gauge theory equations in four dimensions. Here, we…

We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…

The Jones polynomial of a knot in 3-space is a Laurent polynomial in $q$, with integer coefficients. Many people have pondered why is this so, and what is a proper generalization of the Jones polynomial for knots in other closed…

This paper visualizes a knot reduction algorithm

Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…

This paper is a memory of the work and influence of Vaughan Jones. It is an exposition of the remarkable breakthroughs in knot theory and low dimensional topology that were catalyzed by his work. The paper recalls the inception of the Jones…

The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation,…

An elementary introduction to knot theory and its link to quantum field theory is presented with an intention to provide details of some basic calculations in the subject, which are not easily found in texts. Study of Chern-Simons theory…

Knots are deeply entangled with every branch of science. One of the biggest open challenges in knot theory is to formalise a knot invariant that can unambiguously and efficiently distinguish any two knotted curves. Additionally, the…

In this report, I will start by first giving a brief introduction on knots to build some intuition before beginning the more rigorous review in the Literature Review section. There, I will define knot equivalence, the Jones polynomial…

We use exponential start time clustering to design faster and more work-efficient parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposition routines with strict restrictions on the diameters of…

Symmetry of geometrical figures is reflected in regularities of their algebraic invariants. Algebraic regularities are often preserved when the geometrical figure is topologically deformed. The most natural, intuitively simple but…

The viscous flow of polymer chains in dense melts is dominated by topological constraints whenever the single chain contour length, N, becomes larger than the characteristic scale Ne, defining comprehensively the macroscopic rheological…

The topological framework of circuit topology has recently been introduced to complement knot theory and to help in understanding the physics of molecular folding. Naturally evolved linear molecular chains, such as proteins and nucleic…

This is a survey talk on one of the best known quantum knot invariants, the colored Jones polynomial of a knot, and its relation to the algebraic/geometric topology and hyperbolic geometry of the knot complement. We review several aspects…

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…

We present a faster direct sampling algorithm for random equilateral closed polygons in three-dimensional space. This method improves on the moment polytope sampling algorithm of Cantarella, Duplantier, Shonkwiler, and Uehara (2016) and has…

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 use deep neural networks to machine learn correlations between knot invariants in various dimensions. The three-dimensional invariant of interest is the Jones polynomial $J(q)$, and the four-dimensional invariants are the Khovanov…

We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decomposition. Algorithms for solving polynomial systems combine low-level routines for performing arithmetic operations on…