Related papers: Encoding knots by clasp diagrams
The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
We describe an alternative way of computing Alexander polynomials of knots/links, based on the Artin representation of the corresponding braids by automorphisms of a free group. Then we apply the same method to other representations of…
The altenating knots, links and twists projected on the S_2 sphere are identified with the phase Space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossing points, the edges, to the…
We investigate Feynman diagrams which are calculable in terms of generalized one-loop functions, and explore how the presence or absence of transcendentals in their counterterms reflects the entanglement of link diagram constructed from…
We extend the theory of Vassiliev (or finite type) invariants for knots to knotoids using two different approaches. Firstly, we take closures on knotoids to obtain knots and we use the Vassiliev invariants for knots, proving that these are…
We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…
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…
In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…
We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…
Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…
Parity mappings from the chords of a Gauss diagram to the integers is defined. The parity of the chords is used to construct families of invariants of Gauss diagrams and virtual knots. One family consists of degree $n$ Vassiliev invariants.
Two geometric spaces are in the same topological class if they are related by certain geometric deformations. We propose machine learning methods that automate learning of topological invariance and apply it in the context of knot theory,…
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…
A chord diagram is a circle with paired points with each pair of points connected by a chord. Every generic immersed spherical curve provides a chord diagram by associating each chord with two preimages of a double point. Any two spherical…
In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
This article surveys the use of configuration space integrals in the study of the topology of knot and link spaces. The main focus is the exposition of how these integrals produce finite type invariants of classical knots and links. More…
The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial…