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

DOI10.1090/conm/689/13860zbMath1386.57021arXiv1707.07733OpenAlexW2738938147MaRDI QIDQ4635086

Józef H. Przytycki

Publication date: 13 April 2018

Published in: Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.07733

zbMATH Keywords

complexitydynamic programmingcomputationknot polynomials

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Vassiliev knot invariants derived from cable \(\Gamma \)-polynomials ⋮ The (2,1)-cable Γ-polynomials of knots up to ten crossings ⋮ The HOMFLY-PT polynomial is fixed-parameter tractable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knotoids
• A polynomial invariant of oriented links
• A new polynomial invariant of knots and links
• Invariants of links of Conway type
• On the computational complexity of the Jones and Tutte polynomials
• Calculating the 2-variable polynomial for knots presented as closed braids
• Polynomials for Links

This page was built for publication: The first coefficient of Homflypt and Kauffman polynomials: Vertigan proof of polynomial complexity using dynamic programming