DeepAI AI Chat
Log In Sign Up

Parameterized complexity of quantum invariants

by   Clément Maria, et al.

We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a O(N^3/2cwpoly(n)) time algorithm to compute any Reshetikhin-Turaev invariant—derived from a simple Lie algebra g—of a link presented by a planar diagram with n crossings and carving-width cw, and whose components are coloured with g-modules of dimension at most N. For example, this includes the N^th coloured Jones polynomials and the N^th coloured HOMFLYPT polynomials.


page 1

page 2

page 3

page 4


The HOMFLY-PT polynomial is fixed-parameter tractable

Many polynomial invariants of knots and links, including the Jones and H...

A Structural Approach to Tree Decompositions of Knots and Spatial Graphs

Knots are commonly represented and manipulated via diagrams, which are d...

Spined categories: generalizing tree-width beyond graphs

We develop a general theory of categories that admit a functorial invari...

A user's guide to basic knot and link theory

This paper is expository and is accessible to students. We define simple...

Computing a Link Diagram from its Exterior

A knot is a circle piecewise-linearly embedded into the 3-sphere. The to...

Computation of Large Asymptotics of 3-Manifold Quantum Invariants

Quantum topological invariants have played an important role in computat...

Generalizations of k-Weisfeiler-Leman partitions and related graph invariants

The family of Weisfeiler-Leman equivalences on graphs is a widely studie...