Commun. Math. Res., 32 (2016), pp. 198-206.
Published online: 2021-05
Cited by
- BibTex
- RIS
- TXT
Khovanov type homology is a generalization of Khovanov homology. The main result of this paper is to give a recursive formula for Khovanov type homology of pretzel knots $P(−n, −m, m)$. The computations reveal that the rank of the homology of pretzel knots is an invariant of $n$. The proof is based on a "shortcut" and two lemmas that recursively reduce the computational complexity of Khovanov type homology.
}, issn = {2707-8523}, doi = {https://doi.org/10.13447/j.1674-5647.2016.03.02}, url = {http://global-sci.org/intro/article_detail/cmr/18898.html} }Khovanov type homology is a generalization of Khovanov homology. The main result of this paper is to give a recursive formula for Khovanov type homology of pretzel knots $P(−n, −m, m)$. The computations reveal that the rank of the homology of pretzel knots is an invariant of $n$. The proof is based on a "shortcut" and two lemmas that recursively reduce the computational complexity of Khovanov type homology.