Related papers: A simple algorithm to compute link polynomials def…
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…
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…
In this note we define a polynomial invariant for colored links by a skein relation. It specializes to the Jones polynomial for classical links.
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…
In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called…
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute…
We propose a new method for numerical calculation of link plynomials for knots given in 3 dimensions. We calculate derivatives of the Jones polynomial in a computational time proportional to $N^{\alpha}$ with respect to the system size $N$…
Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
New invariants of links are constructed using the skein invariant polynomial of colored links defined by the author in [1]. These invariants are stronger than the homflypt polynomial.
This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…
Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…
We give characterizations of the skein polynomial for links (as well as Jones and Alexander-Conway polynomials derivable from it), avoiding the usual "smoothing of a crossing" move. As by-products we have characterizations of these…
For arborescent links, we present an efficient method of computing their Alexander polynomials. Applying this method, we express the Alexander polynomials of Montesinos links in terms of certain functions associated to rational tangles…
Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
Pulling back the weight systems associated with the exceptional Lie algebras and their standard representations by a modification of the universal Vassiliev-Kontsevich invariant yields link invariants; extending them to coloured 3-nets, we…
We present a reduced Burau-like representation for the mixed braid group on one strand representing links in lens spaces and show how to calculate the Alexander polynomial of a link directly from the mixed braid.