Khovanov complexes for bipartite links

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 22-hypercube is shrinked to the bipartite 3-hypercube.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…