Related papers: Evaluating the Jones polynomial with tensor networ…
Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…
It has been argued based on electric-magnetic duality that the Jones polynomial of a knot in three dimensions can be computed by counting the solutions of certain gauge theory equations in four-dimension. And the Euler characteristic of…
In this master thesis, I present a new family of knots in the solid torus called lassos, and their properties. Given a knot $K$ with Alexander polynomial $\Delta_K(t)$, I then use these lassos as patterns to construct families of satellite…
Two geometric spaces are in the same topological class if they are related by certain geometric deformations. We propose machine learning methods that automate learning of topological invariance and apply it in the context of knot theory,…
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs…
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…
In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
Using the vertex model approach for braid representations, we compute polynomials for spin-1 placed on hyperbolic knots up to 15 crossings. These polynomials are referred to as 3-colored Jones polynomials or adjoint Jones polynomials.…
The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for…
Circuit topology employs fundamental units of entanglement, known as soft contacts, for constructing knots from the bottom up, utilising circuit topology relations, namely parallel, series, cross, and concerted relations. In this article,…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ…
Accurate contraction of tensor networks beyond one dimension is essential in various fields including quantum many-body physics. Existing approaches typically rely on approximate contraction schemes and do not provide certified error bars.…
In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy.…
It has long been known that the quadratic term in the degree of the colored Jones polynomial of a knot is bounded above in terms of the crossing number of the knot. We show that this bound is sharp if and only if the knot is adequate. As an…
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…
A tensor network is a product of tensors associated with vertices of some graph $G$ such that every edge of $G$ represents a summation (contraction) over a matching pair of indexes. It was shown recently by Valiant, Cai, and Choudhary that…
A tensor network is a type of decomposition used to express and approximate large arrays of data. A given data-set, quantum state or higher dimensional multi-linear map is factored and approximated by a composition of smaller multi-linear…
Building on the approach of Bar-Natan and Van der Veen to universal knot invariants using (perturbed) Gaussian functions, we develop a Gaussian model to compute the Alexander polynomial $\Delta_{\mathcal{K}}(T)$ of an oriented knot…