Related papers: Multiple Linking Number
To each three-component link in the 3-sphere, we associate a geometrically natural characteristic map from the 3-torus to the 2-sphere, and show that the pairwise linking numbers and Milnor triple linking number that classify the link up to…
We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…
We prove the existence of a degree 7 Vassiliev invariant of long (or string) two-component links which is not preserved under the simultaneous change of orientation of both components. The non-invertibility of this invariant can be detected…
A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…
The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…
Given any oriented link diagram, two types of new knot invariants are constructed. They satisfy some generalized skein relations. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations of those…
With the idea of an eventual classification of 3-bridge links,\ we define a very nice class of 3-balls (called butterflies) with faces identified by pairs, such that the identification space is $S^{3},$ and the image of a prefered set of…
Bott and Taubes constructed knot invariants by integrating differential forms along the fiber of a bundle over the space of knots, generalizing the Gauss linking integral. Their techniques were later used to construct real cohomology…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\alpha(L)-2 \leq c_2(D) + \sum_{n> 2}(2n-4)c_n(D)$ holds. Here $\alpha(L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and…
We consider Milnor invariants for certain covering links as a generalization of covering linkage invariants formulated by R. Hartley and K. Murasugi. A set of Milnor invariants for covering links is a cobordism invariant of a link, and that…
We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…
Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister…
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…
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…
It is known that alternative links are pseudoalternating. In 1983 Louis Kauffman conjectured that both classes are identical. In this paper we prove that Kauffman Conjecture holds for those links whose first Betti number is at most 2.…
A categorification of a polynomial link invariant is an homological invariant which contains the polynomial one as its graded Euler characteristic. This field has been initiated by Khovanov categorification of the Jones polynomial. Later,…
We extend the results of our previous paper from knots to links by using a formula for the Jones polynomial of a link derived recently by N. Reshetikhin. We illustrate this formula by an example of a torus link. A relation between the…
Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…