Related papers: A simple algorithm to compute link polynomials def…
The aim of this paper is to define two link invariants satisfying cubic skein relations. In the hierarchy of polynomial invariants determined by explicit skein relations they are the next level of complexity after Jones, HOMFLY, Kauffman…
Many interesting families of polynomials are indexed by permutations or related objects, and are defined by applying divided difference operators, modified by polynomials, on some initial base case. The fact that these constructions produce…
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
In this paper we define and present a simple combinatorial formula for a 3-variable Laurent polynomial invariant of conjugacy classes in Artin braid group $B_m$. We show that this Laurent polynomial satisfies the Conway skein relation and…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polynomial time algorithm. We investigate polynomial time…
In recent years, twisted Alexander polynomial has been playing an important role in low-dimensional topology. For Montesinos links, we develop an efficient method to compute the twisted Alexander polynomial associated to any linear…
Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and…
We present a new 2-variable generalization of the Jones polynomial that can be defined through the skein relation of the Jones polynomial. The well-definedness of this new generalization is proved both algebraically and diagrammatically as…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
We provide an explicit algorithm to calculate invariant tensors for the adjoint representation of the simple Lie algebra $sl(n)$, as well as arbitrary representation in terms of roots. We also obtain explicit formulae for the adjoint…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
We introduce a numerical method for generating the approximating polynomials used in fermionic calculations with smeared link actions. We investigate the stability of the algorithm and determine the optimal weight function and the optimal…
In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
We use the skein theory of $\mathfrak{sl}_3$-webs to study the properties of the quantum $\mathfrak{sl}_3$-link polynomial of positive links. We give explicit formulae for the three leading terms of the polynomial on positive links in terms…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…