2000 character limit reached
Patterns in odd Khovanov homology
Published 28 Jan 2011 in math.GT, math.QA, and math.SG | (1101.5607v3)
Abstract: We investigate properties of the odd Khovanov homology, compare and contrast them with those of the original (even) Khovanov homology, and discuss applications of the odd Khovanov homology to other areas of knot theory and low-dimensional topology. We show that it provides an effective upper bound on the Thurston-Bennequin number of Legendrian links and can be used to detect quasi-alternating knots. A potential application to detecting transversely non-simple knots is also mentioned.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.