arXiv · math/0606318
Fast Khovanov Homology Computations
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dror Bar-Natan. 2006-06-13. Fast Khovanov Homology Computations. https://arxiv.org/abs/math/0606318
Cite the original work for its findings. Save a collection to share your selection of sources.