A Dynamic Approach to Calculating the HOMFLY Polynomial for Directed Knots and Links
Edit Page
Report
Scan day: 17 February 2014 UTC
-155
Virus safety - good
Description: A research paper describing an algorithm for calculating the HOMFLY polynomial of directed knots and links. The algorithm has a better time bound for large links than algorithns that ignore duplicates. Source code is on the site.
A Dynamic Approach to Calculating the HOMFLY Polynomial for Directed Knots and Links A Dynamic Programming Approach to Calculating the HOMFLY Polynomial for Directed Knots and Links The HOMFLY polynomial invariant for directed knots and links is a powerful tool for distinguishing knots and links. A recursive formula is used to calculate it. Applying this formula produces a binary tree of intermediate links. This paper presents an algorithm that encourages and collects duplicate intermediate links. It has a better time bound (and a better running time) for large links than algorithms which ignore duplicates. The time bound is O((n!)(2
Size: 641 chars
Contact Information
Email: —
Phone&Fax: 1625702400
Address: —
Extended: —
WEBSITE Info
| Page title: | A Dynamic Approach to Calculating the HOMFLY Polynomial for Directed Knots and Links |
| Keywords: | |
| Description: | |
| IP-address: | 65.254.250.102 |
WHOIS Info
| NS | Name Server: NS2.POWWEB.COM Name Server: NS3.POWWEB.COM |
| WHOIS | Status: clientDeleteProhibited Status: clientRenewProhibited Status: clientTransferProhibited Status: clientUpdateProhibited |
| Date | Creation Date: 08-jul-1999 Expiration Date: 08-jul-2015 |