Knots in lattice homology

From MaRDI portal
Publication:484255

DOI10.4171/CMH/334zbMATH Open1309.57023arXiv1208.2617OpenAlexW2963025381MaRDI QIDQ484255FDOQ484255


Authors: András I. Stipsicz, Zoltán Szabó, Peter Ozsváth Edit this on Wikidata


Publication date: 6 January 2015

Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)

Abstract: Assume that Gamma_{v_0} is a tree with vertex set Vert(Gamma_{v_0})={v_0, v_1,..., v_n}, and with an integral framing (weight) attached to each vertex except v_0. Assume furthermore that the intersection matrix of G=Gamma_{v_0}-{v_0} is negative definite. We define a filtration on the chain complex computing the lattice homology of G and show how to use this information in computing lattice homology groups of a negative definite graph we get by attaching some framing to v_0. As a simple application we produce families of graphs which have arbitrarily many bad vertices for which the lattice homology groups are shown to be isomorphic to the corresponding Heegaard Floer homology groups.


Full work available at URL: https://arxiv.org/abs/1208.2617




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Knots in lattice homology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484255)