Related papers: Learning bridge numbers of knots

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it…

We study the properties of glued knots, a sub-class of real rational knots, that can be constructed by gluing ellipses. We define an invariant called the gluing degree and relate it to various classical properties of knots and classify all…

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

Machine learning (ML) is increasingly used in structural engineering and design, yet its broader adoption is hampered by the lack of openly accessible datasets of structural systems. We introduce BridgeNet, a publicly available graph-based…

Quantum decision systems are being increasingly considered for use in artificial intelligence applications. Classical and quantum nodes can be distinguished based on certain correlations in their states. This paper investigates some…

We have the generating function which determines the number of $2$-bridge knot groups admitting epimorphisms onto the knot group of a given $2$-bridge knot, in terms of crossing number. In this paper, we will refine this formula by taking…

This paper defines a theory of cobordism for virtual knots and studies this theory for standard and rotational virtual knots and links. Non-trivial examples of virtual slice knots are given. Determinations of the four-ball genus of positive…

All knots are fused isotopic to the unknot via a process known as virtualization. We extend and adapt this process to show that, up to fused isotopy, classical links are classified by their linking numbers.

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 find explicit maximal rank Coxeter quotients for the knot groups of 595,515 out of the 1,701,936 knots through 16 crossings. We thus calculate the bridge numbers and verify Cappell and Shaneson's Meridional Rank Conjecture for these…

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…

We describe the genus two knots which admit a genus one, one bridge position. These are divided into several families, one consists of vertical bandings of two genus one $(1,1)$-knots, other consists of vertical bandings of two cross cap…

We compute the bridge spectra of cables of 2-bridge knots. We also give some results about bridge spectra and distance of Montesinos knots.

In this work, we find a closed form formula for the braid index of an $n$-bridge braid, a class of positive braid knots which simultaneously generalizes torus knots, 1-bridge braids, and twisted torus knots. Our proof is elementary,…

This paper extends the construction of invariants for virtual knots to virtual long knots and introduces two new invariant modules of virtual long knots. Several interesting features are described that distinguish virtual long knots from…

We present an atlas of Legendrian knots in standard contact three-space. This gives a conjectural Legendrian classification for all knots with arc index at most 9, including alternating knots through 7 crossings and nonalternating knots…

Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links: in…

We compute lower bounds on the virtual crossing number and minimal surface genus of virtual knot diagrams from the arrow polynomial. In particular, we focus on several interesting examples.

In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By applying new criteria, we prove that 6 virtual knots are not…

We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.