A fast algorithm for calculating $s$-invariants

Abstract

We use the divide-and-conquer and scanning algorithms for calculating Khovanov cohomology directly on the Lee- or Bar-Natan deformations of the Khovanov complex to give an alternative way to compute Rasmussen $s$-invariants of knots. By disregarding generators away from homological degree 0 we can considerably improve the efficiency of the algorithm. With a slight modification we can also apply it to a refinement of Lipshitz-Sarkar.

22 pages

References in corpus (3)

• On the Khovanov and knot Floer homologies of quasi-alternating links
• A Khovanov stable homotopy type
• Computable bounds for Rasmussen's concordance invariant

Cited by in corpus (1)

• Khovanov homology and rational unknotting