Papers
Topics
Authors
Recent
Search
2000 character limit reached

The first coefficient of Homflypt and Kauffman polynomials: Vertigan proof of polynomial complexity using dynamic programming

Published 24 Jul 2017 in math.GT | (1707.07733v1)

Abstract: We describe the polynomial time complexity algorithm for computing first coefficients of the skein (Homflypt) and Kauffman polynomial invariants of links, discovered by D.Vertigan in 1992 but never published.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up