2005•arXiv (Cornell University)Open access

When the theories meet: Khovanov homology as Hochschild homology of links

Józef H. Przytycki

Open full text 0 citations

Abstract

We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a $(2,n)$-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov homology. In the classical case of Khovanov homology we prove the concrete connection. In the general case of Khovanov-Rozansky, $sl(n)$, homology and their deformations we conjecture the connection. The best framework to explore our ideas is to use a comultiplication-free version of Khovanov homology for graphs developed by L. Helme-Guizon and Y. Rong and extended here to to $\mathbb M$-reduced case, and to noncommutative algebras (in the case of a graph being a polygon). In this framework we prove that for any unital algebra $\A$ the Hochschild homology of $\A$ is isomorphic to graph homology over $\A$ of a polygon. We expect that this paper will encourage a flow of ideas in both directions between Hochschild/cyclic homology and Khovanov homology theories.

Open-access reader

About this research paper

What this paper is about

We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a $(2,n)$-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov homology. In the classical case of Khovanov homology we prove the concrete connection. In the general case of Khovanov-Rozansky, $sl(n)$, homology and their deformations we conjecture the connection. The best framework to explore our ideas is to use a comultiplication-free version of Khovanov homology for graphs developed by L. Helme-Guizon and Y. Rong and extended here to to $\mathbb M$-reduced case, and to noncommutative algebras (in the case of a graph being a polygon). In this framework we prove that for any unital algebra $\A$ the Hochschild homology of $\A$ is isomorphic to graph homology over $\A$ of a polygon. We expect that this paper will encourage a flow of ideas in both directions between Hochschild/cyclic homology and Khovanov homology theories.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a $(2,n)$-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov homology. In the classical case of Khovanov homology we prove the concrete connection. In the general case of Khovanov-Rozansky, $sl(n)$, homology and their deformations we conjecture the connection. The best framework to explore our ideas is to use a comultiplication-free version of Khovanov homology for graphs developed by L. Helme-Guizon and Y. Rong and extended here to to $\mathbb M$-reduced case, and to noncommutative algebras (in the case of a graph being a polygon). In this framework we prove that for any unital algebra $\A$ the Hochschild homology of $\A$ is isomorphic to graph homology over $\A$ of a polygon. We expect that this paper will encourage a flow of ideas in both directions between Hochschild/cyclic homology and Khovanov homology theories.

Key concepts: Khovanov homology, Hochschild homology, Homology (biology), Cellular homology, Mathematics, Pure mathematics, Computer science, Communication

Related papers

Back to paper searchBrowse research topicsOriginal source
When the theories meet: Khovanov homology as Hochschild homology of links — Research Paper | ScholarLens