A fast algorithm for computing Jones polynomials of Montesinos links

MaRDI QIDQ3619683zbMATH OpenFDO

Authors Masao Hara, Masahiko Murakami, Seiichi Tani, Makoto Yamamoto

Publication date 8 April 2009

Full work available at URL http://www.jams.or.jp/scm/abstract/e-2008/2008-54a.txt

zbMATH Keywords

computational topologyknot theorycombinatorial algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Fast algorithms for computing Jones polynomials of certain links
• Jones polynomial of knots formed by repeated tangle replacement operations
• On the computational complexity of the Jones and Tutte polynomials
• An algorithm for calculating Jones polynomials
• scientific article; zbMATH DE number 1305557

Cited in

(7)

• On computing Kauffman bracket polynomial of Montesinos links
• scientific article; zbMATH DE number 475580 (Why is no real title available?)
• Computing twisted Alexander polynomials for Montesinos links
• Computing HOMFLY polynomials of 2-bridge links from 4-plat representation
• Computing Khovanov homology via categorified Jones-Wenzl projectors
• Fast algorithms for computing Jones polynomials of certain links
• Jones polynomial of knots formed by repeated tangle replacement operations

This page was built for publication: A fast algorithm for computing Jones polynomials of Montesinos links

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