Related papers: On the complexity of meander-like diagrams of knot…
In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…
Let $K$ be a prime knot in $S^3$ and $G(K)=\pi_1(S^3-K)$ the knot group. We write $K_1 \geq K_2$ if there exists a surjective homomorphism from $G(K_1)$ onto $G(K_2)$. In this paper, we determine this partial order on the set of prime knots…
Using a combinatorial approach described in a recent paper of Manolescu, Ozsv\'ath, and Sarkar we compute the Heegaard-Floer knot homology of all knots with at most 12 crossings as well as the $\tau$ invariant for knots through 11…
For a knot or link K, let L(K) be the ropelength of K and Cr(K) be the crossing number of K. In this paper, we show that there exists a constant a>0 such that L(K) is bounded above by a Cr(K) ln^5 (Cr(K)) for any knot K. This result shows…
It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is…
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…
A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by R. Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots.…
We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…
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 proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…
In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of links.
There are 46,972 prime knots with crossing number 14. Among them 19,536 are alternating and have arc index 16. Among the non-alternating knots, 17, 477, and 3,180 have arc index 10, 11, and 12, respectively. The remaining 23,762 have arc…
We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $\cal{E}$ be the number of edges of its diagram. Then there exists a code such that…
A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…
We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…
The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…
The slicing degree of a knot $K$ is defined as the smallest integer $k$ such that $K$ is $k$-slice in $\#^n \overline{\mathbb{CP}^2}$ for some $n$. In this paper, we establish bounds for the slicing degrees of knots using Rasmussen's…
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…
The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…