Abstract

We give an algorithm for reducing the number of generators of the Khovanov chain complex of the torus braid ftnk=(σ1σ2⋯σn−1)kft^k_n = (σ_1σ_2\cdots σ_{n-1})^k on nn strands by applying Bar-Natan Gaussian elimination along a distinguished set of Gaussian elimination isomorphisms. We call the resulting complex FTnk\mathcal{FT}^k_n a \emph{whittled complex} for the Khovanov homology of torus braids. Using this algorithm, we provide a bound for the number of generators at a fixed homological degree in our whittled complex.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.