A simple algorithm to compute link polynomials defined by using skein relations
From MaRDI portal
Publication:2236700
Abstract: We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete link invariant are obtained.
Recommendations
- Calculating the 2-variable polynomial for knots presented as closed braids
- An algorithm for calculating Jones polynomials
- Computation of the Kauffman bracket skeleton
- On the calculation of the Kauffman bracket polynomial
- Computer evaluation of Homfly polynomials by using Gauss codes, with a skein-template algorithm
Cites work
- A computer program to calculate Alexander polynomial from Braids presentation of the given knot
- A fast method for comparing braids
- A new polynomial invariant of knots and links
- An algorithm for calculating Jones polynomials
- Conway Algebras and Skein Equivalence of Links
- Fast algorithms for computing Jones polynomials of certain links
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 1305557 (Why is no real title available?)
- Modelling supercoiled DNA knots and catenanes by means of a new regular isotopy invariant
- q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
Cited in
(3)
This page was built for publication: A simple algorithm to compute link polynomials defined by using skein relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236700)
