Fast Khovanov Homology Computations
几何拓扑
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0606318,
title = {Fast Khovanov Homology Computations},
author = {Dror Bar-Natan},
journal= {arXiv preprint arXiv:math/0606318},
year = {2007}
}
备注
12 pages, many figures. Dedicated to Lou Kauffman on his 60th birthday