2000 character limit reached
The Khovanov homology of 3-strand pretzels, revisited
Published 13 Mar 2013 in math.GT | (1303.3303v2)
Abstract: We compute the reduced Khovanov homology of 3-stranded pretzel links. The coefficients are the integers with the "even" sign assignment. In particular, we show that the only homologically thin, non-quasi-alternating 3-stranded pretzels are P(-p,p,r) with p an odd integer and r greater than or equal to p (these were shown to be homologically thin by Starkston and Qazaqzeh).
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.