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

Masahiko Murakami,Fumio Takeshita,Seiichi Tani

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

2014

Masahiko Murakami
Fumio Takeshita
Seiichi Tani

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.

Keywords:

Computational topology
Discrete mathematics
Combinatorics
Polynomial
Diagram
Knot theory
Mathematics
Algebra
combinatorial algorithms

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations