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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.