Related papers: Learning bridge numbers of knots
Using Gauss diagrams, one can define the virtual bridge number ${\rm vb}(K)$ and the welded bridge number ${\rm wb}(K),$ invariants of virtual and welded knots with ${\rm wb}(K) \leq {\rm vb}(K).$ If $K$ is a classical knot, Chernov and…
The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for…
We define the virtual bridge number $vb(K)$ and the virtual unknotting number $vu(K)$ invariants for virtual knots. For ordinary knots $K$ they are closely related to the bridge number $b(K)$ and the unknotting number $u(K)$ and we have…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…
The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm for the problem.
We investigate connections between biquandle colorings, quiver enhancements, and several notions of the bridge numbers $b_i(K)$ for virtual links, where $i=1,2$. We show that for any positive integers $m \leq n$, there exists a virtual link…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
For classical knots, there is a concept of (semi)meander diagrams; in this short note we generalize this concept to virtual knots and prove that the classes of meander and semimeander diagrams are universal (this was known for classical…
For any given number of crossings $c$, there exists a formula to determine the number of 2-bridge knots of $c$ crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of…
Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…
In this research, we aim to compare the performance of different classical machine learning models and neural networks in identifying the frequency of occurrence of each digit in a given number. It has various applications in machine…
We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of…
In our works with Stoimenow, Vdovina and with Byberi, we introduced the virtual canonical genus $g_{vc}(K)$ and the virtual bridge number $vb(K)$ invariants of virtual knots. One can see from the definitions that for an classical knot $K$…
We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…
In this paper, we determine the average genus of all the $2$-bridge knots with a given crossing number. As a consequence, we obtain the oblique asymptote of this value as the crossing number grows.
Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…
We construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The…
A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that…
There are three commonly known definitions of the bridge index. These definitions come from combinatorial knot theory, Morse theory, and geometry. In this paper, we prove that the danceability index is a fourth equivalent definition of the…
The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger…