Jones polynomial of knots formed by repeated tangle replacement operations

DOI10.1016/J.TOPOL.2009.05.006zbMATH Open1207.57010OpenAlexW2087473174MaRDI QIDQ837637FDOQ837637

Authors: Claus Ernst, U. Ziegler, Y. Diao 

Publication date: 20 August 2009

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.topol.2009.05.006

Recommendations

• A fast algorithm for computing Jones polynomials of Montesinos links
• Fast algorithms for computing Jones polynomials of certain links
• On the computational complexity of the Jones and Tutte polynomials
• scientific article; zbMATH DE number 475580
• A polynomial time knot polynomial

zbMATH Keywords

Jones polynomialknotstanglesTutte polynomialcolored graphs2-sumtensor product of graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computational complexity of the Jones and Tutte polynomials
• A Tutte polynomial for signed graphs
• A spanning tree expansion of the Jones polynomial
• New Invariants in the Theory of Knots
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• A Tutte Polynomial for Coloured Graphs
• An algorithm for the Tutte polynomials of graphs of bounded treewidth
• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• Parallel connections and coloured Tutte polynomials
• The Tutte polynomial. I: General theory
• Sampling large random knots in a confined space
• COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
• Tutte polynomials computable in polynomial time
• On the colored Tutte polynomial of a graph of bounded treewidth
• TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY
• Fast algorithms for computing Jones polynomials of certain links
• Invariants of composite networks arising as a tensor product
• HAMILTONIAN CYCLES AND ROPE LENGTHS OF CONWAY ALGEBRAIC KNOTS
• Numerical upper bounds on ropelengths of large physical knots
• Title not available (Why is that?)

Cited In (11)

• Invariants of composite networks arising as a tensor product
• Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory
• Computing HOMFLY polynomials of 2-bridge links from 4-plat representation
• Efficient computation of the Kauffman bracket
• Fast algorithms for computing Jones polynomials of certain links
• A fast algorithm for computing Jones polynomials of Montesinos links
• The architecture and the Jones polynomial of polyhedral links
• The Homfly and dichromatic polynomials
• Relative Tutte polynomials of tensor products of coloured graphs
• When can a link be obtained from another using crossing exchanges and smoothings?
• A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS

Uses Software

• Knotscape

This page was built for publication: Jones polynomial of knots formed by repeated tangle replacement operations

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