|
Organizers |
An Implementation of Dynamic Programming Algorithm for Computing the coefficients of the Homflypt Polynomial
by
David Ledvinka
The University of Toronto
We present an implementation of the algorithm from the paper "The first coefficient of Homflypt and Kauffman polynomials: Vertigan proof of polynomial complexity using dynamic programming" by J. H. Przytycki, which allows one to compute the first several coefficients of the Homflypt polynomial of a knot in polynomial time. For example we were able to compute the first coefficient of a (randomly generated) 1000 crossing knot in under a minute.
Date received: November 11, 2018
Copyright © 2018 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbpq-11.