Related papers: Average crosscap number of a 2-bridge knot

Let $c(K)$ denote the crossing number of a knot $K$ and let $K_1\# K_2$ denote the connected sum of two oriented knots $K_1$ and $K_2$. It is a very old unsolved question that whether $c(K_1\# K_2)=c(K_1)+c(K_2)$. In this paper we show that…

We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…

Let $K,K'$ be two-bridge knots of genus $n,k$ respectively. We show the necessary and sufficient condition of $n$ in terms of $k$ that there exists an epimorphism from the knot group of $K$ onto that of $K'$.

We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…

We investigate the nonorientable 4-genus $\gamma_4$ of a special family of 2-bridge knots, the twist knots and double twist knots $C(m,n)$. Because the nonorientable 4-genus is bounded by the nonorientable 3-genus, it is known that…

We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…

We study the 3-dimensional immersed crosscap number of a knot, which is a nonorientable analogue of the immersed Seifert genus. We study knots with immersed crosscap number 1, and show that a knot has immersed crosscap number 1 if and only…

The crosscap number of a knot in the 3-sphere is the minimal genus of non-orientable surface bounded by the knot. We determine the crosscap numbers of torus knots.

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…

This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…

A rational knot or link can be put into a standard alternating format which has horizontal and vertical twist sites (double helices). The number and type of these twist sites are determined by terms of next-to-highest $z$-degree in…

The genus non-increasing totally positive unknotting number is the minimum number of crossing changes that transform a knot into the unknot, such that all the crossing changes are positive-to-negative crossing changes that do not increase…

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.

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

For a given knot, we study the minimal number of positive eigenvalues of the double branched cover over spanning surfaces for the knot. The value gives a lower bound for various genera, the dealternating number and the alternation number of…

The concordance crosscap number $\gamma_c(K)$ of a knot $K$ is the smallest crosscap number $\gamma_3(K')$ of any knot $K'$ concordant to $K$ (and with $\gamma_3(K')$ defined as the least first Betti number of any nonorientable surface…

Let $u(K)$ and $g(K)$ denote the unknotting number and the genus of a knot $K$, respectively. For a 3-braid knot $K$, we show that $u(K)\le g(K)$ holds, and that if $u(K)=g(K)$ then $K$ is either a 2-braid knot, a connected sum of two…

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel…

We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to…

Let $H$ be a normal subgroup of a group $G$. The normal subgroup based power graph $\Gamma_H(G)$ of $G$ is the simple undirected graph with vertex set $V(\Gamma_H(G))= (G\setminus H)\cup \{e\}$ and two distinct vertices $a$ and $b$ are…