Table of Contents
Fetching ...

Khovanov--Rozansky matrix factorization reduction for bipartite links

Elena Lanina, Radomir Stepanov

TL;DR

The work develops a local reduction of the Khovanov–Rozansky matrix-factorization framework for bipartite links, yielding a cycle-based calculus analogous to the $N=2$ Khovanov construction. It establishes the universality of the morphisms $Sh$, $Δ$, and $m$ and introduces a variable-exclusion method that collapses cohomology factor-rings to vector spaces spanned by odd variables, producing a monocomplex of tensor products of $N$-dimensional spaces. The approach extends the KR framework to arbitrary $N$ for bipartite links and clarifies connections to the triply-graded link homology, while providing a practical, diagram-local pathway to relate KR invariants to the HOMFLY polynomial. Together, these results significantly simplify KR computations and enable direct comparisons with MOY/HOMFLY methods across a broad class of links.

Abstract

The Khovanov-Rozansky (KR) link polynomial is a certain $t$-deformation of Wilson loops in 3-dimensional $SU(N)$ Chern--Simons topological field theory, believed to be an observable in the refined Chern-Simons theory, probably described in terms of 4d or 5d QFT and related by a certain procedure to the triply-graded link superpolynomial. This link invariant was originally introduced by M. Khovanov and L. Rozansky through a sophisticated matrix factorization technique based on the bicomplex structure, which depends on entire link diagrams and rapidly increases in complexity with the growth of a link. However, for particular link diagrams a local reduction is possible, allowing to eliminate vertices in a regular way, and thus, simplifying the KR polynomial and making it as simple as the Khovanov polynomial in the $N=2$ case. In particular, for a distinguished family of bipartite links, matrix factorization defined on MOY diagrams reduces just to planar cycles - very similar to the original Kauffman-Khovanov construction at $N=2$ for the Jones polynomial and its $t$-deformation. In the bipartite case, this can be done for any $N$. We make a further step of simplification and reduce from cohomology factor-rings in even variables crucially depending on a MOY diagram to vector spaces spanned by odd variables, so that the initial bicomplex of matrix factorizations becomes a monocomplex of just tensor products of $N$-dimensional vector spaces. We also find the explicit form of three universal morphisms which were guessed in a recent paper on this subject. Universality means independence of the other edges of the diagram, and we explain why this works in this particular case.

Khovanov--Rozansky matrix factorization reduction for bipartite links

TL;DR

The work develops a local reduction of the Khovanov–Rozansky matrix-factorization framework for bipartite links, yielding a cycle-based calculus analogous to the Khovanov construction. It establishes the universality of the morphisms , , and and introduces a variable-exclusion method that collapses cohomology factor-rings to vector spaces spanned by odd variables, producing a monocomplex of tensor products of -dimensional spaces. The approach extends the KR framework to arbitrary for bipartite links and clarifies connections to the triply-graded link homology, while providing a practical, diagram-local pathway to relate KR invariants to the HOMFLY polynomial. Together, these results significantly simplify KR computations and enable direct comparisons with MOY/HOMFLY methods across a broad class of links.

Abstract

The Khovanov-Rozansky (KR) link polynomial is a certain -deformation of Wilson loops in 3-dimensional Chern--Simons topological field theory, believed to be an observable in the refined Chern-Simons theory, probably described in terms of 4d or 5d QFT and related by a certain procedure to the triply-graded link superpolynomial. This link invariant was originally introduced by M. Khovanov and L. Rozansky through a sophisticated matrix factorization technique based on the bicomplex structure, which depends on entire link diagrams and rapidly increases in complexity with the growth of a link. However, for particular link diagrams a local reduction is possible, allowing to eliminate vertices in a regular way, and thus, simplifying the KR polynomial and making it as simple as the Khovanov polynomial in the case. In particular, for a distinguished family of bipartite links, matrix factorization defined on MOY diagrams reduces just to planar cycles - very similar to the original Kauffman-Khovanov construction at for the Jones polynomial and its -deformation. In the bipartite case, this can be done for any . We make a further step of simplification and reduce from cohomology factor-rings in even variables crucially depending on a MOY diagram to vector spaces spanned by odd variables, so that the initial bicomplex of matrix factorizations becomes a monocomplex of just tensor products of -dimensional vector spaces. We also find the explicit form of three universal morphisms which were guessed in a recent paper on this subject. Universality means independence of the other edges of the diagram, and we explain why this works in this particular case.

Paper Structure

This paper contains 2 sections, 5 equations.