摘要
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.
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.
基金
The NSF(11271282,11371013)of China
the Graduate Innovation Fund of USTS
