Related papers: Enumerating the Prime Alternating Knots, Part I

We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…

We study the minimal crossing number $c(K_{1}\# K_{2})$ of composite knots $K_{1}\# K_{2}$, where $K_1$ and $K_2$ are prime, by relating it to the minimal crossing number of spatial graphs, in particular the $2n$-theta curve…

This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram…

For a knot $K$, the doubly slice genus $g_{ds}(K)$ is the minimal $g$ such that $K$ divides a closed, orientable, and unknotted surface of genus $g$ embedded in $S^4$. In this paper, we identify the doubly slice genera of 2909 of the 2977…

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

We give a survey of some recent papers by the authors and Masaaki Wada relating the twisted Alexander polynomial with a partial order on the set of prime knots. We also give examples and pose open problems.

We explore under what conditions one can obtain a nontrivial knot, given a collection of $n$ vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the…

Levine defined the rational algebraic knot concordance group and proved that each nontrivial element is of order two, of order four, or of infinite order. The determination of the order of an element depends on a p-adic analysis for all…

The transient number of a knot K, denoted tr(K), is the minimal number of simple arcs that have to be attached to K, in order that K can be homotoped to a trivial knot in a regular neighborhood of the union of K and the arcs. We give a…

A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…

We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin…

Generalizing unknotting number, $n$-adjacent knots have $n$ crossings such that changing any non-empty subset of them results in the unknot. In this paper, we determine the 2-adjacent knots through 12 crossings. Using Heegaard Floer…

It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…

The ropelength of a knot is the minimum length required to tie it. Computational upper bounds have previously been computed for every prime knot with up to 11 crossings. Here, we present ropelength measurements for the 2176 knots with 12…

Shimizu introduced a region crossing change unknotting operation for knot diagrams. As extensions, two integral region choice problems were proposed and the existences of solutions of the problems were shown for all non-trivial knot…

This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…

We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…

In 2000, Thomas Fink and Young Mao studied neck ties and, with certain assumptions, found 85 different ways to tie a neck tie. They gave a formal language which describes how a tie is made, giving a sequence of moves for each neck tie. The…