2000 character limit reached
A diagrammatic grading bound for colored link homology
Published 26 Aug 2026 in math.GT and math.QA | (2608.25676v1)
Abstract: We establish a grading bound for colored link homology that can be read off from any link diagram. In the context of contact geometry, this gives a bound on the Thurston--Bennequin number of a Legendrian link from link homology, in the spirit of Ng.
Paper Prompts
Sign up for free to create and run prompts on this paper.