|
This article is available for purchase or by subscription. See below.
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
–strand
torus links.
|
PDF Access Denied
We have not been able to recognize your IP address
18.222.163.31
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
Khovanov homology, concordance invariants, odd Khovanov
homology
|
Mathematical Subject Classification
Primary: 57K18
Secondary: 57K10
|
Publication
Received: 21 August 2020
Revised: 1 March 2021
Accepted: 19 March 2021
Published: 25 August 2022
|
|
