Related papers: Arc-presentations of links. Monotonic simplificati…

In this note, I describe a formalism for treating knots as geometric spaces, and make an application to a simple statistical mechanics computation. The motivation for this study is the natural visual symmetry of the knot, and I describe how…

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…

Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…

A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once. We consider arrangements that are outerplanar---each crossing is…

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…

The most elusive problem around the class of circular-arc graphs is identifying all minimal graphs that are not in this class. The main obstacle is the lack of a systematic way of enumerating these minimal graphs. McConnell [FOCS 2001]…

We introduce new skein invariants of links based on a procedure where we first apply the skein relation only to crossings of distinct components, so as to produce collections of unlinked knots. We then evaluate the resulting knots using a…

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of…

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 give a simple obstruction for a knot to be amphichiral, in terms of the homology of the 2-fold branched cover. We work with unoriented knots, and so obstruct both positive and negative amphichirality.

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister…

If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three…

We prove that a knot is the unknot if and only if its reduced Khovanov cohomology has rank 1. The proof has two steps. We show first that there is a spectral sequence beginning with the reduced Khovanov cohomology and abutting to a knot…

We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…

We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…

In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…

A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis…

Links of singularity and generalized algebraic links are ways of constructing three-manifolds and smooth links inside them from potentially singular complex algebraic surfaces and complex curves inside them. We prove that knot lattice…

The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…