Computing Finite Type Invariants Efficiently

Dror Bar-Natan, Itai Bar-Natan, Iva Halacheva +1

We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of…