Torus link homology and the nabla operator

preprint2016arXivOpen access

Abstract

In recent work, Elias and Hogancamp develop a recurrence for the Poincaré series of the triply graded Hochschild homology of certain links, one of which is the (n,n)(n,n) torus link. In this case, Elias and Hogancamp give a combinatorial formula for this homology that is reminiscent of the combinatorics of the modified Macdonald polynomial eigenoperator ∇\nabla. We give a combinatorial formula for the homologies of all links considered by Elias and Hogancamp. Our first formula is not easily computable, so we show how to transform it into a computable version. Finally, we conjecture a direct relationship between the (n,n)(n,n) torus link case of our formula and the symmetric function ∇p1n\nabla p_{1^n}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.