An algorithm for calculating jones polynomials
El-Misiery, A. E.M.; El-Sayed M. El-Horbaty;
Abstract
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. © Elsevier Science Inc., 1996.
Other data
| Title | An algorithm for calculating jones polynomials | Authors | El-Misiery, A. E.M.; El-Sayed M. El-Horbaty | Issue Date | 1-Jan-1996 | Journal | Applied Mathematics and Computation | Volume | 74 | Issue | 2-3 | Start page | 249 | End page | 259 | ISSN | 00963003 | DOI | 10.1016/0096-3003(95)00096-8 | Scopus ID | 2-s2.0-23644458135 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.