Related papers: A simple algorithm to compute link polynomials def…
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
Construction of representations of braid group generators from $N$-state vertex models provide an elegant route to study knot and link invariants. Using such a braid group representation, an algebraic formula for the link invariants was put…
In this paper we show how generalized quaternions, including 2X2 matrices, can be used to find solutions of a non-commuting equation intimately connected with braid groups. These solutions can then be used to find polynomial invariants of…
We construct new invariant polynomial for long virtual knots. It is a generalization of Alexander polynomial. We designate it by $\zeta$ meaning an analogy with $\zeta$-polynomial for virtual links. A degree of $\zeta$-polynomial estimates…
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
Many link prediction algorithms require the computation of a similarity metric on each vertex pair, which is quadratic in the number of vertices and infeasible for large networks. We develop a class of link prediction algorithms based on a…
In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…
This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram…
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…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
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…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern-Simons theory, these invariants can be found from crossing and braiding matrices of…
In this paper, we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete…
In these notes we review the calculation of Jones polynomials using a matrix representation of the braid group and Temperley-Lieb algebra. The pseudounitary representation that we consider allows constructing ``states'' from the…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
We define invariants for a framed link equipped with a SL2 local system in its complement and additional combinatorial data based on the theory of representations of stated skein algebras at roots of unity of punctured bigons and the…
We give an explicit formula for the Jones polynomial of any rational link in terms of the denominators of the canonical continued fraction of the slope of the given rational link.
The Homflypt and Kauffman skein modules of the projective space are computed. Both are free and generated by some infinite set of links. This set may be chosen to be L_n, where L_n is an arbitrary link consisting of n projective lines for…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…