2000 character limit reached
Foams and sl(n) cohomology for tangles (n > 3)
Published 13 Feb 2013 in math.GT and math.QA | (1302.2985v2)
Abstract: We use 4-valent planar graphs and singular cobordisms (called foams) to construct an integral doubly-graded cohomology for tangles, and in particular for links, whose graded Euler characteristic yields the sl(n) link polynomial (for n > 3).
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.
