Related papers: A Practical Algorithm for Knot Factorisation

We give a topological characterisation of alternating knot exteriors based on the presence of special spanning surfaces. This shows that alternating is a topological property of the knot exterior and not just a property of diagrams,…

This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n…

Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…

While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…

The most tight conformations of prime knots are found with the use of the SONO algorithm. Their curvature and torsion profiles are calculated. Symmetry of the knots is analysed. Connections with the physics of polymers are discussed.

A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…

In this paper we look for closed expressions to calculate the number of colourings of prime knots for given linear Alexander quandles. For this purpose the colouring matrices are simplified to a triangular form, when possible. The…

We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr\"obner bases. We present a novel scalable algorithm which combines the two approaches and leads to the…

We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…

We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function and then transforming the k-bit coupling ($k\geq 3$) terms to quadratic terms…

The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…

In this paper we summarise the work discussed in Ref. [1] and [2] (q-alg/9505003), in which we introduced a method helpful in solving the problem of knot classification. We also present results obtained since then.

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…

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…

We examine the structure and dimensionality of the Jones polynomial using manifold learning techniques. Our data set consists of more than 10 million knots up to 17 crossings and two other special families up to 2001 crossings. We introduce…

We use a version of simulated annealing with knot-type preserving moves to find polygonal representatives of various knot types with low stick number. These give better bounds on stick numbers of prime knots through 10 crossings, and for…

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

Recently Iltgen, Lewark and Marino introduced the concept of a proper rational tangle replacement and the corresponding notion of the proper rational unknotting number. In this note we derive a version of the Montesinos trick for proper…