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

Authors:
Masahiko Murakami;Fumio Takeshita;Seiichi Tani
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 8
Cited 0

Calculating the 2-variable polynomial for knots presented as closed braids

Journal of Algorithms
Complexity: knots, colourings and counting

Complexity: knots, colourings and counting
The computational complexity of knot and matroid polynomials

Proceedings of the first Malta conference on Graphs and combinatorics
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The parametrized complexity of knot polynomials

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Fast algorithms for computing Jones polynomials of certain links

Theoretical Computer Science
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note: On the colored Tutte polynomial of a graph of bounded treewidth

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We propose an algorithm for computing HOMFLY polynomials of 2-bridge links from 4-plat representation in O(n^3) time, where n is the number of the crossings of a given input diagram.