Combinatorial Heegaard Floer homology and nice Heegaard diagrams
Author(s): Ozsvath, Peter Steven; Stipsicz, Andras I.; Szabo, Zoltan
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr11h30
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ozsvath, Peter Steven | - |
dc.contributor.author | Stipsicz, Andras I. | - |
dc.contributor.author | Szabo, Zoltan | - |
dc.date.accessioned | 2018-07-20T15:07:27Z | - |
dc.date.available | 2018-07-20T15:07:27Z | - |
dc.date.issued | 2012-09-10 | en_US |
dc.identifier.citation | Ozsvath, Peter, Stipsicz, Andras I, Szabo, Zoltan. (2012). Combinatorial Heegaard Floer homology and nice Heegaard diagrams. ADVANCES IN MATHEMATICS, 231 (102 - 171. doi:10.1016/j.aim.2012.04.008 | en_US |
dc.identifier.issn | 0001-8708 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr11h30 | - |
dc.description.abstract | We consider a stabilized version of (HF) over cap of a 3-manifold Y (i.e. the U = 0 variant of Heegaard Floer homology for closed 3-manifolds). We give a combinatorial algorithm for constructing this invariant, starting from a Heegaard decomposition for Y, and give a topological proof of its invariance properties. (C) 2012 Elsevier Inc. All rights reserved. | en_US |
dc.format.extent | 102 - 171 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | ADVANCES IN MATHEMATICS | en_US |
dc.rights | Final published version. Article is made available in OAR by the publisher's permission or policy. | en_US |
dc.title | Combinatorial Heegaard Floer homology and nice Heegaard diagrams | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | doi:10.1016/j.aim.2012.04.008 | - |
dc.date.eissued | 2012-05-31 | en_US |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1-s2.0-S0001870812001478-main.pdf | 1.75 MB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.