pith. sign in

arxiv: 2605.25650 · v1 · pith:322XGP7Vnew · submitted 2026-05-25 · ✦ hep-th · math-ph· math.GT· math.MP

Khovanov complexes for bipartite links

classification ✦ hep-th math-phmath.GTmath.MP
keywords bipartitehypercubekauffman-khovanovkhovanovlinksanaloguearbitrarycalculus
0
0 comments X
read the original abstract

Recently, for a limited class for bipartite links, the complicated Khovanov-Rozansky matrix factorization technique was reduced to an analogue of elementary Kauffman-Khovanov cycle calculus for an arbitrary $N$. In this note, we demonstrate the consistency of such reduction with the computation of the bipartite Khovanov polynomials for $N=2$. Namely, we explain how the Kauffman-Khovanov $2^2$-hypercube is shrinked to the bipartite 3-hypercube.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.