Related papers: Enumerating the Prime Alternating Knots, Part I

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

As a continuation of the previous works to tabulate the prime knots up to arc index 11, we provide the list of prime knots with arc index 12 up to 16 crossings and their minimal grid diagrams. There are 19,513 prime knots of arc index 12 up…

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…

Families of alternating knots (links) and tangles are studied using as building block the conway defined as the twisting of two strands. The regular representation of knots assumes the projection has the minimal number of overpassings, and…

Decomposing knots and links into tangles is a useful technique for understanding their properties. The notion of prime tangles was introduced by Kirby and Lickorish in [3]; Lickorish proved [5] that by summing prime tangles one obtains a…

A long standing open conjecture states that if a link $\mathcal{K}$ is alternating, then its ropelength $L(\mathcal{K})$ is at least of the order $O(Cr(\mathcal{K}))$. A recent result shows that the maximum braid index of a link bounds the…

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

We use a version of simulated annealing with knot-type preserving moves to find polygonal representatives of various knot types with low stick number. These give better bounds on stick numbers of prime knots through 10 crossings, and for…

Cohomology theory of links, introduced by the author, is combinatorial. Dror Bar-Natan recently wrote a program that found ranks of cohomology groups of all prime knots with up to 11 crossings. His surprising experimental data is discussed…

Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…

This is a short expository article on alternating knots and is to appear in the Concise Encyclopedia of Knot Theory.

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…

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…

Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams…

We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…

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…

We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…

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…

Let $L$ be an alternating prime non-split link in $S^3$. We use the category of flypes between reduced alternating diagrams for $L$ to classify involutions on $L$. As consequences, we show that the quotient of an alternating periodic link…