With PQDT Open, you can read the full text of open access dissertations and theses free of charge.
About PQDT Open
Search
Heegaard Floer homology is a collection of invariants for closed oriented three-manifolds, introduced by Ozsvath and Szabó in 2001. The simplest version is defined as the homology of a chain complex coming from a Heegaard diagram of the three manifold. In the original definition, the differentials count the number of points in certain moduli spaces of holomorphic disks, which are hard to compute in general.
More recently, Sarkar and Wang (2006) and Ozsvath, Stipsicz and Szabó, (2009) have determined combinatorial methods for computing this homology with Z2 coefficients. Both methods rely on the construction of very specific Heegaard diagrams for the manifold, which are generally very complicated.
Given a decorated Heegaard diagram H for a closed oriented 3-manifold Y, that is a Heegaard diagram together with a collection of embedded paths satisfying certain criteria, we describe a combinatorial recipe for a chain complex CF'[special character omitted]( H). If H satisfies some technical constraints we show that this chain complex is homotopically equivalent to the Heegaard Floer chain complex CF[special character omitted](H) and hence has the Heegaard Floer homology HF[special character omitted](Y) as its homology groups. Using branched spines we give an algorithm to construct a decorated Heegaard diagram which satisfies the necessary technical constraints for every closed oriented Y. We present this diagram graphically in the form of a strip diagram.
Advisor: | Shumakovitch, Alexander |
Commitee: | Przytycki, Jozef, Rong, Yongwu, Ullman, Daniel, Viro, Oleg, Wu, Hao |
School: | The George Washington University |
Department: | Mathematics |
School Location: | United States -- District of Columbia |
Source: | DAI-B 76/11(E), Dissertation Abstracts International |
Source Type: | DISSERTATION |
Subjects: | Mathematics |
Keywords: | Floer, Heegaard, Homology, Manifolds, Spines |
Publication Number: | 3713943 |
ISBN: | 978-1-321-90909-8 |