arXiv · 0803.2379
Effective computation of knot Floer homology
Abstract
We extend an approach of Beliakova for computing knot Floer homology and implement it in a publicly available computer program. We review the main programming and optimization methods used. Our program is then used to check that the Floer homology of a prime non-alternating knot with less than 12 crossings has no torsion.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jean-Marie Droz. 2008-03-17. Effective computation of knot Floer homology. https://arxiv.org/abs/0803.2379
Cite the original work for its findings. Save a collection to share your selection of sources.