An algorithm for calculating Jones polynomials

摘要

This paper is concerned with the consequences of calculating the two-variable invariant polynomials associated with representation of braid groups (Jones polynomials). Recurrence relations for simplifying the required calculations have been driven and an algorithm depending on them has been designed. We implemented the algorithm using Mathematica as a computing environment and computational results are given.