Table of Contents
Fetching ...

Computing Khovanov-Rozansky homology and defect fusion

Nils Carqueville, Daniel Murfet

TL;DR

The categorified sl(N) link invariants as defined by Khovanov and Rozansky are computed, for various links and values of N, made tractable by an algorithm for reducing tensor products of matrix factorisations to finite rank.

Abstract

We compute the categorified sl(N) link invariants as defined by Khovanov and Rozansky, for various links and values of N. This is made tractable by an algorithm for reducing tensor products of matrix factorisations to finite rank, which we implement in the computer algebra package Singular.

Computing Khovanov-Rozansky homology and defect fusion

TL;DR

The categorified sl(N) link invariants as defined by Khovanov and Rozansky are computed, for various links and values of N, made tractable by an algorithm for reducing tensor products of matrix factorisations to finite rank.

Abstract

We compute the categorified sl(N) link invariants as defined by Khovanov and Rozansky, for various links and values of N. This is made tractable by an algorithm for reducing tensor products of matrix factorisations to finite rank, which we implement in the computer algebra package Singular.