Fast Khovanov Homology Computations

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages, many figures. Dedicated to Lou Kauffman on his 60th birthday

Citation

Consulte el texto completo en el siguiente enlace:

Collections