Papers
Topics
Authors
Recent
Search
2000 character limit reached

A diagrammatic grading bound for colored glN\mathfrak{gl}_N link homology

Published 26 Aug 2026 in math.GT and math.QA | (2608.25676v1)

Abstract: We establish a grading bound for colored glN\mathfrak{gl}_N 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 glN\mathfrak{gl}_N link homology, in the spirit of Ng.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.