Shows that the Kauffman-Khovanov 2²-hypercube reduces to the bipartite 3-hypercube for N=2, confirming consistency of the reduction for bipartite links.
Fast Khovanov Homology Computations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We introduce a local algorithm for Khovanov Homology computations - that is, we explain how it is possible to "cancel" terms in the Khovanov complex associated with a ("local") tangle, hence canceling the many associated "global" terms in one swoosh early on. This leads to a dramatic improvement in computational efficiency. Thus our program can rapidly compute certain Khovanov homology groups that otherwise would have taken centuries to evaluate.
fields
hep-th 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Khovanov complexes for bipartite links
Shows that the Kauffman-Khovanov 2²-hypercube reduces to the bipartite 3-hypercube for N=2, confirming consistency of the reduction for bipartite links.