Related papers: Algorithmic simplification of knot diagrams: new m…

For each diagram $D$ of a $2$-knot, we provide a way to construct a new diagram $D'$ of the same knot such that any sequence of Roseman moves between $D$ and $D'$ necessarily involves branch points. The proof is done by developing the…

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

We present a complete classification of spherical knotoids with up to six crossings and conjecture that our classification up to seven crossings is complete. Our work extends the tradition of knot tabulation to the setting of knotoids…

Recently, the author discovered an interesting class of knot-like objects called free knots. These purely combinatorial objects are equivalence classes of Gauss diagrams modulo Reidemeister moves (the same notion in the language of words…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

We define a set of restricted Reidemeister moves and show that if $K$ is obtained from $K_0\,\#\,K_1$ using those moves, then the crossing number of $K$ is at least $c(K_0)+c(K_1)$. We also explore topological interpretations of this…

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…

In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be…

A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…

Rowmotion is a simple cyclic action on the distributive lattice of order ideals of a poset: it sends the order ideal x to the order ideal generated by the minimal elements not in x. It can also be computed in "slow motion" as a sequence of…

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and…

A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…

A (weak chord) index is a function on the crossings of knot diagrams such that: 1) the index of a crossing does not change under Reidemeister moves; 2) crossings which can be paired by a second Reidemeister move have the same index. We show…

This is an introduction to the construction of higher-dimensional knots by spinning methods. Simple spinning of classical knots was introduced by E. Artin in 1926, and several generalizations have followed. These include twist spinning,…

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

Two knots in three-space are S-equivalent if they are indistinguishable by Seifert matrices. We show that S-equivalence is generated by the doubled-delta move on knot diagrams. It follows as a corollary that a knot has trivial Alexander…

We give a generating set of the generalized Reidemeister moves for oriented singular links. We use it to introduce an algebraic structure arising from the study of oriented singular knots. We give some examples, including some…