Morse matchings and Khovanov homology of 4-strand torus links
arXiv:2507.15060
Abstract
Given a link or a tangle diagram, we define algorithmic Morse theoretic simplifications on their Khovanov homology. In contrast to Bar-Natan's scanning algorithm, the cancellations are postponed until the end and performed in one go. Although our novel approach is computationally inferior to Bar-Natan's algorithm, it side-steps the need for a large amount of iterations, making it more fitting for theoretical analysis. Our main application is towards integral Khovanov homology of 4-strand torus links, for which we compute non-trivial Khovanov homology groups in all homological degrees and find an abundance of -torsion. At the limit , our computations agree with a conjecture of Gorsky, Oblomkov and Rasmussen. For finite , we use the -invariant of Lewark, Marino and Zibrowius to derive lower bounds on proper rational Gordian distances from .
53 pages, many figures. Comments welcome!