# Knots in lattice homology

## Author(s): Ozsvath, Peter Steven; Stipsicz, Andras I.; Szabo, Zoltan

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr15h3c
DC FieldValueLanguage
dc.contributor.authorOzsvath, Peter Steven-
dc.contributor.authorStipsicz, Andras I.-
dc.contributor.authorSzabo, Zoltan-
dc.date.accessioned2018-07-20T15:09:03Z-
dc.date.available2018-07-20T15:09:03Z-
dc.date.issued2014en_US
dc.identifier.citationOzsvath, Peter, Stipsicz, Andras I, Szabo, Zoltan. (2014). Knots in lattice homology. COMMENTARII MATHEMATICI HELVETICI, 89 (783 - 818. doi:10.4171/CMH/334en_US
dc.identifier.issn0010-2571-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr15h3c-
dc.description.abstractAssume that Gamma(v0) is a tree with vertex set Vert(Gamma(v0)) = 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(v0) - 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 new families of graphs which have arbitrarily many bad vertices for which the lattice homology groups are isomorphic to the corresponding Heegaard Floer homology groups.en_US
dc.format.extent783 - 818en_US
dc.language.isoen_USen_US
dc.relation.ispartofCOMMENTARII MATHEMATICI HELVETICIen_US
dc.rightsAuthor's manuscripten_US
dc.titleKnots in lattice homologyen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.4171/CMH/334-
dc.date.eissued2014-11-25en_US
dc.identifier.eissn1420-8946-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat