Related papers: Invariants of Knot Diagrams

We construct many examples of non-slice knots in 3-space that cannot be distinguished from slice knots by previously known invariants. Using Whitney towers in place of embedded disks, we define a geometric filtration of the 3-dimensional…

In this paper we describe what should perhaps be called a `type-2' Vassiliev invariant of knots S^2 -> S^4. We give a formula for an invariant of 2-knots, taking values in Z_2 that can be computed in terms of the double-point diagram of the…

We construct an invariant of virtual knots which is a sliceness obstruction and sensitive to the $\Delta$-move. This invariants works if $\Z_{2}\oplus \Z_{2}$-index of chords is present.

We define counting and cocycle enhancement invariants of virtual knots using parity biquandles. These invariants are determined by pairs consisting of a biquandle 2-cocycle \phi^0 and a map \phi^1 with certain compatibility conditions…

This an article about some elementary geometric and combinatorial natures of various knot energies. A related "new" knot invariant -- the X-crossing number -- is introduced.

Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…

Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic…

We compute Vassiliev invariants up to order six for arbitrary pretzel knots, which depend on $g+1$ parameters $n_1,\ldots,n_{g+1}$. These invariants are symmetric polynomials in $n_1,\ldots,n_{g+1}$ whose degree coincide with their order.…

We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of…

We introduce three kinds of invariants of a virtual knot called the first, second, and third intersection polynomials. The definition is based on the intersection number of a pair of curves on a closed surface. The calculations of…

In the present paper, we discuss a way of generalising Vassiliev knot invariants and weight systems to framed chord diagrams having framing 0 and 1.

As it is well-known, all Vassiliev invariants of degree one of a knot $K\subset R^3$ are trivial. There are nontrivial Vassiliev invariants of degree one, when the ambient space is not $R^3$. Recently, T. Fiedler introduced such invariants…

We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…

We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

The simultaneous crossing number is a new knot invariant which is defined for strongly invertible knots having diagrams with two orthogonal transvergent axes of strong inversions. Because the composition of the two inversions gives a cyclic…

Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…

Polyak proved that all oriented versions of Reidemeister moves for knot and link diagrams can be generated by a set of just four oriented Reidemeister moves, and that no fewer than four oriented Reidemeister moves generate them all. We…

For each link type $K$ in the 3-sphere, we show that there is a polynomial $p_K$ such that any two diagrams of $K$ with $c_1$ and $c_2$ crossings differ by at most $p_K(c_1) + p_K(c_2)$ Reidemeister moves. As a consequence, the problem of…

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…