Related papers: Learning bridge numbers of knots
The stick number of a knot is the minimum number of segments needed to build a polygonal version of the knot. Despite its elementary definition and relevance to physical knots, the stick number is poorly understood: for most knots we only…
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
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…
We compute the genus zero bridge numbers and give lower bounds on the genus one bridge numbers for a large class of sufficiently generic hyperbolic twisted torus knots. As a result, the bridge spectra of these knots have two gaps which can…
The $\Delta$-unknotting number for a knot is defined as the minimum number of $\Delta$-moves needed to deform the knot into the trivial knot. We determine the $\Delta$-unknotting numbers for two-bridge knots of type $C(2\beta_1, 2\beta_2,…
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…
I briefly discuss a method of obtaining distinct classes of topologically equivalent knots by developing appropriate computer programs.
In this survey paper we present the $L$--moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot…
The 2-bridge knots are a family of knots with bridge number 2. In this paper, we compute the Kauffman polynomials of 2-bridge knots using the Kauffman skein theory and linear algebra techniques. Our calculation can be easily carried out…
We introduce an equivalence relation, called stable equivalence, on knot diagrams and closed curves on surfaces. We give bijections between the set of abstract knots, the set of virtual knots, and the set of the stable equivalence classes…
In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.
In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…
A key phase in the bridge design process is the selection of the structural system. Due to budget and time constraints, engineers typically rely on engineering judgment and prior experience when selecting a structural system, often…
The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…
In this paper, we discuss the region unknotting number of different classes of 2-bridge knots. In particular, we provide region unknotting number for the classes of $2$-bridge knots whose Conway notation is $C(m,\ n), C(m,\ 2,\ m),$ $ C(m,\…
We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…
This paper studies an algebraic invariant of virtual knots called the biquandle. The biquandle generalizes the fundamental group and the quandle of virtual knots. The approach taken in this paper to the biquandle emphasizes understanding…
We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to…