Related papers: On the complexity of meander-like diagrams of knot…
We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…
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 present a table of symmetric diagrams for strongly invertible knots up to 10 crossings, point out the similarity of transvergent diagrams for strongly invertible knots with symmetric union diagrams and discuss open questions.
One measure of geometrical complexity of a spatial curve is the number of crossings in a planar projection of the curve. For $N$-noded ring polymers with a fixed knot type, we evaluate numerically the average of the crossing number over…
Binary representations of the trefoil and other knots of up to ten crossings in the simple cubic lattice were created. The BiEntropy of each knot was computed using a variety of binary encodings and compared against controls. This showed…
Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes…
Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…
An \"{u}bercrossing diagram is a knot diagram with only one crossing that may involve more than two strands of the knot. Such a diagram without any nested loops is called a petal projection. Every knot has a petal projection from which the…
The space writhe of a knot is a property of its three-dimensional embedding that contains information about its underlying topology, but the correspondence between space writhe and other topological invariants is not fully understood. We…
We develop and implement an algorithm that computes the full knot Floer complex of knots of thickness one. As an application, by extending this algorithm to certain knots of thickness two, we show that all but finitely many non-integral…
We are giving tables of quasi-alternating knots with $8\le n \le 12$ crossings. As the obstructions for a knot to be quasialternating we used homology thickness with regards to Khovanov homology, odd homology, and Heegaard-Floer homology…
We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph $G$ is a knotted loop, then there…
Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an \"ubercrossing projection, a knot…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…
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…
Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
We say that two knots are friends if they share the same 0-surgery. Two friends with different sliceness status would provide a counterexample to the 4-dimensional smooth Poincar\'e conjecture. Here we create a census of all friends with…
We present the complete classification of the subgroup of the classical knot concordance group generated by knots with eight or fewer crossings. Proofs are presented in summary. We also describe extensions of this work to the case of nine…
A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…