An algorithm for calculating Jones polynomials

DOI10.1016/0096-3003(95)00096-8zbMath0846.65003OpenAlexW2055698808MaRDI QIDQ1914622

El-Sayed M. El-Horbaty, A. E. M. El Misiery

Publication date: 26 September 1996

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(95)00096-8

zbMATH Keywords

algorithmnumerical examplesbraid groupsrecurrence relationsMathematicainvariant polynomialsJones polynomials

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Computation of special functions and constants, construction of tables (65D20)

Related Items

A simple algorithm to compute link polynomials defined by using skein relations

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• On the Jones polynomial of closed 3-braids
• Hecke algebra representations of braid groups and link polynomials
• Calculating Wadati-Deguchi-Akutsu \(N=3\) knot polynomials
• A new polynomial invariant of knots and links