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

DOI10.1016/J.DAM.2013.08.023MaRDI QIDQ741749zbMATH OpenOpenAlexFDO

Authors Masahiko Murakami, Fumio Takeshita, Seiichi 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

computational topologyknot theorycombinatorial algorithm

Mathematics Subject Classification ID

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

Recommendations

• On the HOMFLY polynomial of 4-plat presentations of knots
• An algorithm to compute the Kauffman polynomial of 2-bridge knots
• Fast algorithms for computing Jones polynomials of certain links
• A fast algorithm for computing Jones polynomials of Montesinos links
• EXPLICIT DESCRIPTION OF THE HOMFLY POLYNOMIALS FOR 2-BRIDGE KNOTS AND LINKS

Cites work

• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 34890 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 791397 (Why is no real title available?)
• A fast algorithm for computing Jones polynomials of Montesinos links
• A new polynomial invariant of knots and links
• A polynomial invariant for knots via von Neumann algebras
• A polynomial invariant of oriented links
• COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
• Calculating the 2-variable polynomial for knots presented as closed braids
• Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Conway Algebras and Skein Equivalence of Links
• EXPLICIT DESCRIPTION OF THE HOMFLY POLYNOMIALS FOR 2-BRIDGE KNOTS AND LINKS
• Fast algorithms for computing Jones polynomials of certain links
• Jones polynomial of knots formed by repeated tangle replacement operations
• Knots.
• On the colored Tutte polynomial of a graph of bounded treewidth
• On the computational complexity of the Jones and Tutte polynomials
• The computational complexity of knot and matroid polynomials
• The parametrized complexity of knot polynomials

Cited in

(4)

• The HOMFLY-PT polynomial is fixed-parameter tractable
• On the HOMFLY polynomial of 4-plat presentations of knots
• Fast algorithms for computing Jones polynomials of certain links
• HOMFLY polynomials for 3-component links with \(v\)-span 4

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741749)