Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777464 | Journal of Combinatorial Theory, Series A | 2018 | 16 Pages |
Abstract
In recent work, Elias and Hogancamp develop a recurrence for the Poincaré series of the triply graded Khovanov-Rozansky homology of certain links, one of which is the (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 â. We give a combinatorial formula for the homologies of all complexes 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) torus link case of our formula and the symmetric function âp1n.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A.T. Wilson,