- Journal Home
- Volume 41 - 2025
- Volume 40 - 2024
- Volume 39 - 2023
- Volume 38 - 2022
- Volume 37 - 2021
- Volume 36 - 2020
- Volume 35 - 2019
- Volume 34 - 2018
- Volume 33 - 2017
- Volume 32 - 2016
- Volume 31 - 2015
- Volume 30 - 2014
- Volume 29 - 2013
- Volume 28 - 2012
- Volume 27 - 2011
- Volume 26 - 2010
- Volume 25 - 2009
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.