Related papers: An Unknotting Index for Virtual Links
Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking…
In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…
The affine index polynomial and the $n$-writhe are invariants of virtual knots which are introduced by Kauffman and by Satoh and Taniguchi independently. They are defined by using indices assigned to each classical crossing, which we call…
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…
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal…
We extend the Wirtinger number of links, an invariant originally defined by Blair, Kjuchukova, Velazquez, and Villanueva in terms of extending initial colorings of some strands of a diagram to the entire diagram, to spatial graphs. We prove…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…
An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there…
The unknotting number is the classical invariant of a knot. However, its determination is difficult in general. To obtain the unknotting number from definition one has to investigate all possible diagrams of the knot. We tried to show the…
In the present paper we bring together minimality conditions proposed in previous two papers and present some new minimality conditions for classical and virtual knots and links.
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
For a virtual knot $K$ and an integer $r\geq 0$, the $r$-covering $K^{(r)}$ is defined by using the indices of chords on a Gauss diagram of $K$. In this paper, we prove that for any finite set of virtual knots $J_0,J_2,J_3,\dots,J_m$, there…
It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is…
The determination of the braid index of an oriented link is generally a hard problem. In the case of alternating links, some significant progresses have been made in recent years which made explicit and precise braid index computations…
We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…
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…
This paper is the second part of our comprehensive study on the braid index problem of pretzel links. Our ultimate goal is to completely determine the braid indices of all pretzel links, alternating or non alternating. In our approach, we…
Let $K$ be a link of Conway's normal form $C(m)$, $m \geq 0$, or $C(m,n)$ with $mn\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all…
We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…