Related papers: On arc index and maximal Thurston-Bennequin number
We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…
We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…
In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
An alternating torus knot or link may be constructed from a repeating double helix after connecting its two ends. A structure with additional helices may be closed to form a non-alternating torus knot or link. Previous work has optimized…
We classify knot traces with trisection genus at most 2. We give infinitely many knots whose traces have trisection genus 3, and infinitely many knots whose traces have trisection genus 4. We also show that there exist infinite families of…
Using a knot concordance invariant from the Heegaard Floer theory of Ozsvath and Szabo, we obtain new bounds for the Thurston-Bennequin and rotation numbers of Legendrian knots in S^3. We also apply these bounds to calculate the knot…
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
A knot K is called Gordian adjacent to a knot L if there exists an unknotting sequence for L containing K. We provide a sufficient condition for Gordian adjacency of torus knots via the study of knots in the thickened torus. We also…
Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [D. Pacheco, L. de Lima, C. S. Oliveira, On the Graovac-Ghorbani Index for Bicyclic Graph with No Pendent Vertices, MATCH Commun. Math. Comput.…
The main goal of the present paper is to construct new invariants of knots with additional structure by adding new gradings to the Khovanov complex. The ideas given below work in the case of virtual knots, closed braids and some other cases…
The slice-Bennequin inequality states an upper bound for the self-linking number of a knot in terms of its four-ball genus. The $s$-Bennequin and $\tau$-Bennequin inequalities provide upper bounds on the self-linking number of a knot in…
Although there are infinitely many knots with superbridge index n for every even integer n>2, there are only finitely many knots with superbridge index 3.
Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding…
In 1997, Chekanov gave the first example of a Legendrian nonsimple knot type: the $m(5_2)$ knot. Epstein, Fuchs, and Meyer extended his result by showing that there are at least $n$ different Legendrian representatives with maximal…
We prove that the knots $13n_{592}$ and $15n_{41,127}$ both have stick number 10. These are the first non-torus prime knots with more than 9 crossings for which the exact stick number is known.
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…
It is a very old conjecture that the crossing number of knots is additive under connected sum. In other words, if K#K' is the connected sum of knots K and K', then does the equality c(K#K') = c(K) + c(K') hold? We prove that c(K#K') is at…
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…
We show that, for an alternating knot, the ratio of the diameter of the set of boundary slopes to the crossing number can be arbitrarily large.