Papers
Topics
Authors
Recent
Search
2000 character limit reached

Reductions in Khovanov-Rozansky operator formalism

Published 2 May 2026 in hep-th, math-ph, math.GT, and math.QA | (2605.01584v1)

Abstract: Sophisticated Khovanov-Rozansky (KhR) description of knot invariants in the fundamental representation can be reformulated in terms of bicomplex with a simple physical meaning. Namely, the counterintuitive matrix factorization is substituted by simple operators DD, locally constructed for every MOY resolution of a link diagram, which becomes nilpotent when the diagram has no external lines. Operators for different resolutions are related by equally simple conjugations χ<sup>(±)χ<sup>{(\pm)}. The KhR procedure then splits in two steps - defining vertical'' cohomologies of DD, which are associated with particular resolutions and will be put at vertices of the hypercube, and conjugations χ(±)χ^{(\pm)}, that define morphisms along its edges. As usual, standard combinations of morphisms are nilpotent, and one can definehorizontal'' cohomologies - which are then combined into Poincaré polynomial, called KhR polynomial in application to links. This construction remains global in the sense that resulting cohomologies depend on the entire link diagram, but all its building blocks, including the operators and morphisms are local in the sense that they are defined for its particular vertices. Sometimes, this allows simple local reductions, allowing to eliminate or change particular vertices or sets of those. Along with the obvious case of Reidemeister equivalencies this happens also for antiparallel-lock tangles, what is responsible for simplification of bipartite calculus. In the N=2N=2 and arbitrary NN bipartite cases, one can also provide global reductions transferring the local construction of the KhR double-complex to the global construction of the Khovanov(-like) single-complex.

Authors (3)

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.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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