A scanning algorithm for odd Khovanov homology
Abstract
We adapt Bar-Natan's scanning algorithm for fast computations in (even) Khovanov homology to odd Khovanov homology. We use a mapping cone construction instead of a tensor product, which allows us to deal efficiently with the more complicated sign assignments in the odd theory. The algorithm has been implemented in a computer program. We also use the algorithm to determine the odd Khovanov homology of 3-strand torus links.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.