Automatic Evaluation of the Links-Gould Invariant for all Prime Knots of up to 10 Crossings

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

28 pages, 6 figures. <Author: http://www.kurims.kyoto-u.ac.jp/~ddw/> Minor corrections and references added since version 1

Scientific paper

This paper describes a method for the automatic evaluation of the Links-Gould two-variable polynomial link invariant (LG) for any link, given only a braid presentation. This method is currently feasible for the evaluation of LG for links for which we have a braid presentation of string index at most 5. Data are presented for the invariant, for all prime knots of up to 10 crossings and various other links. LG distinguishes between these links, and also detects the chirality of those that are chiral. In this sense, it is more sensitive than the well-known two-variable HOMFLY and Kauffman polynomials. When applied to examples which defeat the HOMFLY invariant, interestingly, LG `almost' fails. The automatic method is in fact applicable to the evaluation of any such state sum invariant for which an appropriate R matrix and cap and cup matrices have been determined.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Automatic Evaluation of the Links-Gould Invariant for all Prime Knots of up to 10 Crossings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automatic Evaluation of the Links-Gould Invariant for all Prime Knots of up to 10 Crossings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Evaluation of the Links-Gould Invariant for all Prime Knots of up to 10 Crossings will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-199592

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.