Khovanov--Rozansky matrix factorization reduction for bipartite links
Elena Lanina, Radomir Stepanov

TL;DR
This paper simplifies the computation of Khovanov-Rozansky link invariants for bipartite links by reducing complex matrix factorizations to more manageable forms, enabling explicit calculations for any N.
Contribution
It introduces a local reduction technique for KR matrix factorizations on bipartite links, simplifying them to tensor products of vector spaces and providing explicit universal morphisms.
Findings
Reduction of KR matrix factorizations to planar cycles for bipartite links
Simplification to vector spaces spanned by odd variables
Explicit form of three universal morphisms
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
