Header

UZH-Logo

Maintenance Infos

Effective computation of knot Floer homology


Droz, J M (2008). Effective computation of knot Floer homology. Acta Mathematica Vietnamica, 33(3):471-491.

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.

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.

Statistics

Downloads

77 downloads since deposited on 21 Feb 2010
4 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Date:2008
Deposited On:21 Feb 2010 09:19
Last Modified:07 Dec 2017 00:40
Publisher:National Center for Scientific Research, Institute of Mathematics
ISSN:0251-4184
Official URL:http://www.math.ac.vn/publications/acta/33/Toc_ACTA_3_33.htm
Related URLs:http://arxiv.org/abs/0803.2379

Download

Download PDF  'Effective computation of knot Floer homology'.
Preview
Content: Accepted Version
Filetype: PDF
Size: 238kB