Related papers: A note on knot fertility

In this note, we give a short proof that knot Floer thickness is a lower bound on the dealternating number of a knot. The result is originally due to work of Abe and Kishimoto, Lowrance, and Turaev. Our proof is a modification of the…

It is shown that the diameter of the boundary slope set is bounded from above by the twice of the minimal crossing number for a Montesinos knot.

In general, the bridge index of a knot is less than or equal to its braid index. A natural question is when these two values coincide. Motivated by a conjecture of Krishna and Morton, we prove that the bridge index and the braid index…

The non-orientable 4-genus of a knot K in the three sphere is defined to be the minimum first Betti number of a non-orientable surface F in the four-ball so that K bounds F. We will survey the tools used to compute the non-orientable…

We improve the upper bound on the superbridge index $sb[K]$ of a knot type $[K]$ in terms of the bridge index $b[K]$ from $sb[K] \leq 5b -3$ to $sb[K]\leq 3b[k] - 1$.

For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing…

The number of colorings of a knot diagram by a quandle has been shown to be a knot invariant by CJKLS using quandle cohomology methods. In a previous paper by the second named author, the CJKLS invariant was refined and, in particular, it…

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…

The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…

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.

Ito-Takimura recently defined a splice-unknotting number $u^-(D)$ for knot diagrams. They proved that this number provides an upper bound for the crosscap number of any prime knot, asking whether equality holds in the alternating case. We…

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four,…

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.

In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.

The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing…

The $AJ$-conjecture for a knot $K \subset S^3$ relates the $A$-polynomial and the colored Jones polynomial of $K$. If a two-bridge knot $K$ satisfies the $AJ$-conjecture, we give sufficient conditions on $K$ for the $(r,2)$-cable knot $C$…

The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\times P_2$, $K_n\times P_3$ and $K_n\times C_4$.

The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.

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…

We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution. As a corollary, the number of k-noncrossing permutations is equal to the…