Abstract

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.

Highlights

  • Link polynomials are important topological invariants to distinguish links and knots

  • It is known that computing the Jones polynomial is generally ♯P - hard [10], and it is expected to require exponential time in the worst case

  • HOMFLY polynomial P (·), which contains the information of Alexander polynomial, Conway polynomial, Jones polynomial, and etc., could be obtained inductively as follows: (1.1)

Read more

Summary

Introduction

Link polynomials are important topological invariants to distinguish links and knots. It is known that computing the Jones polynomial is generally ♯P - hard [10], and it is expected to require exponential time in the worst case. Many link polynomials can be defined by using the so-called skein relation. P (unknot) = 1, l P (L+) + l−1P (L−) + mP (L0) = 0, (skein relation) where L+, L− and L0 are three link diagrams which are different only on a local region, as indicated in the following figures. We shall provide a simple algorithm to calculate link polynomials, if these polynomials are defined by using skein relations. Our reduction is based on a new total order of the set of all braid representatives.

Braid group and an order of braid representatives
An algorithm
Computing remarks
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.