Khovanov-Rozansky cycle calculus for bipartite links
A. Anokhina, E. Lanina, A. Morozov

TL;DR
This paper introduces a simplified bipartite calculus for a specific class of knots, generalizing Khovanov calculus to arbitrary N without complex matrix factorizations, facilitating the study of superpolynomials.
Contribution
It develops a bipartite calculus that simplifies Khovanov-Rozansky computations for antiparallel lock tangles, avoiding complex matrix factorizations.
Findings
Reproduces Khovanov-Rozansky polynomials in known cases
Simplifies the calculation process for bipartite links
Provides an accessible tool for superpolynomial studies
Abstract
Bipartite calculus is a direct generalization of Kauffman planar expansion from to arbitrary , applicable to the restricted class of knots which are entirely made of antiparallel lock tangles. Whenever applicable, it allows a straightforward generalization of the Khovanov calculus without a need of the technically complicated matrix factorization used for arbitrary in the Khovanov-Rozansky (KR) approach. The main object here is the -dimensional hypercube with being the number of bipartite vertices. Maps, differentials, complex and Poincar\'e polynomials are straightforward and indeed reproduce the Khovanov-Rozansky polynomials in the known cases. This provides a great simplification of the Khovanov-Rozansky calculus on the bipartite locus, what can make it an accessible tool for the study of superpolynomials.
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.
