PreprintarXiv licencearXiv
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.
Versions
Related
BibTeX
@misc{anokhina2026khovanov,
title = {{Khovanov complexes for bipartite links}},
author = {A. Anokhina and E. Lanina and A. Morozov},
howpublished = {arXiv},
year = {2026},
month = may,
doi = {10.48550/arxiv.2605.25650},
eprint = {2605.25650},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.25650},
}
RIS
TY - UNPB
TI - Khovanov complexes for bipartite links
AU - A. Anokhina
AU - E. Lanina
AU - A. Morozov
PY - 2026
DA - 2026/05/25
PB - arXiv
DO - 10.48550/arxiv.2605.25650
UR - https://arxiv.org/abs/2605.25650
AB - 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.
ER -