arXiv Analytics

Sign in

arXiv:0711.4405 [math.GT]AbstractReferencesReviewsResources

A Modification of the Sarkar-Wang Algorithm and an Analysis of its Computational Complexity

Jonathan Hales, Dmytro Karabash, Michael T. Lock

Published 2007-11-28, updated 2008-01-31Version 2

The Sarkar-Wang algorithm computes the hat version of the Heegaard Floer homology of a closed oriented three manifold. This paper analyzes the computational complexity of the Sarkar-Wang algorithm; then the algorithm is modified to obtain a better bound. Then the computational complexity of calculating HFK hat from a Heegaard diagram by means of the modified Sarkar-Wang algorithm is also analyzed. Under certain assumptions it is shown that the modified Sarkar-Wang algorithm is faster than the Manolescu-Ozsvath-Sarkar algorithm.

Comments: 14 pages, 4 figures, fixed two typos
Categories: math.GT
Related articles: Most relevant | Search more
arXiv:math/0607777 [math.GT] (Published 2006-07-31, updated 2008-09-10)
An algorithm for computing some Heegaard Floer homologies
arXiv:1210.4996 [math.GT] (Published 2012-10-18, updated 2015-06-17)
Naturality and mapping class groups in Heegaard Floer homology
arXiv:0804.3624 [math.GT] (Published 2008-04-23, updated 2008-05-10)
Heegaard Floer homology and genus one, one boundary component open books

Links

Toolbox