Computing HOMFLY polynomials of 2-bridge links from 4-plat representation

DOI10.1016/j.dam.2013.08.023zbMath1302.57045OpenAlexW2108563646MaRDI QIDQ741749

Fumio Takeshita, Masahiko Murakami, Sei'ichi Tani

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.023

zbMATH Keywords

knot theorycombinatorial algorithmcomputational topology

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04)

Related Items

The HOMFLY-PT polynomial is fixed-parameter tractable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jones polynomial of knots formed by repeated tangle replacement operations
• Fast algorithms for computing Jones polynomials of certain links
• A polynomial invariant of oriented links
• The computational complexity of knot and matroid polynomials
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Knots.
• The parametrized complexity of knot polynomials
• On the colored Tutte polynomial of a graph of bounded treewidth
• A polynomial invariant for knots via von Neumann algebras
• A new polynomial invariant of knots and links
• Conway Algebras and Skein Equivalence of Links
• COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
• EXPLICIT DESCRIPTION OF THE HOMFLY POLYNOMIALS FOR 2-BRIDGE KNOTS AND LINKS
• On the computational complexity of the Jones and Tutte polynomials
• Calculating the 2-variable polynomial for knots presented as closed braids

This page was built for publication: Computing HOMFLY polynomials of 2-bridge links from 4-plat representation