2000 character limit reached
Sl(N) link homology using foams and the Kapustin-Li formula
Published 16 Aug 2007 in math.GT and math.QA | (0708.2228v3)
Abstract: We use foams to give a topological construction of a rational link homology categorifying the slN link invariant, for N>3. To evaluate closed foams we use the Kapustin-Li formula adapted to foams by Khovanov and Rozansky. We show that for any link our homology is isomorphic to Khovanov and Rozansky's.
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.