Related papers: Multi-crossing Number for Knots and the Kauffman B…

Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating…

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…

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…

We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…

The purpose of this article is to give a preliminary clarification on the relation between crossing number and crossing change. With a main focus on the span of X polynomial, we prove that, as our theorem claims, the crossing number of the…

We study the double slice genus of a knot, a natural generalization of slice genus. We define a notion called band number, a natural generalization of band unknotting number, and prove it is an upper bound on double slice genus. Our bound…

We describe a way of encoding a Kauffman state as a set of tuples, similar to a Gauss code. Then we describe a procedure for using these state codes to determine the unoriented genus and crosscap number of any prime alternating knot or…

Using exhaustive techniques and results from Lackenby and many others, we compute the tunnel number of all 1655 alternating 11 and 12 crossing knots and of 881 non-alternating 11 and 12 crossing knots. We also find all 5525 Montesinos knots…

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet…

In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph…

For a knot K, let b_n(K) be the minimum length of an n-stranded braid representative of K. Examples of knots exist for which b_n(K) is a non-increasing function. We investigate the behavior of b_n(K). We develop bounds on the function in…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…

A knot $K$ is called $(m,n)$-fertile if for every prime knot $K'$ whose crossing number is less than or equal to $m$, there exists an $n$-crossing diagram of $K$ such that one can get $K'$ from the diagram by changing its over-under…

We study the band-unknotting number $u_{nb}(K)$ of a knot $K$, and how it behaves with respect to connect sums. We show that this sub-additive function is not additive under connected sums, by finding infinitely many examples of knots $K_1,…

We study relationships between the colored Jones polynomial and the A-polynomial of a knot. We establish for a large class of 2-bridge knots the AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial.…

In this article we study the braid indices of 2-bridge knots with a fixed crossing number $c$. We show that the average braid index of the set of $2$-bridge knots of crossing number $c$ is asymptotically linear, approaching…

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

A knot K is called n-adjacent to another knot K', if K admits a projection containing n generalized crossings such that changing any 0 < m \leq n of them yields a projection of K'. We apply techniques from the theory of sutured 3-manifolds,…

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…