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

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages 3 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

When the theories meet: Khovanov homology as Hochschild homology of links does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When the theories meet: Khovanov homology as Hochschild homology of links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When the theories meet: Khovanov homology as Hochschild homology of links will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-407393

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.