Computations of Heegaard-Floer knot homology (Q2885406)

The bulk of this paper (53 out of 65 pages) is a table listing the knot Floer homology over \({\mathbb Z}_2\) for all knots with at most 12 crossings and the \(\tau\) invariants for knots with at most 11 crossings. The data on the table was created using the algorithm of Manolescu-Ozváth-Sarkar [\textit{C. Manolescu} et al., Ann. Math. (2) 169, No. 2, 633--660 (2009; Zbl 1179.57022)], and a C++ program written by the authors of the paper under review. The authors obtained their arc presentations using a package by Bar-Natan and Marc Culler's {gridlink} program. With the help of Lenny Ng the authors created a complete list of minimal arc presentations for 11 crossing non-alternating knots and presentations with arc index at most 13 for all 12 crossing non-alternating knots.NEWLINENEWLINESection 1.1 reviews the Manolescu-Ozváth-Sarkar algorithm, and Section 1.2 reviews developments since the first version of the paper was drafted in 2006. Section 2 explains the methodology used by the authors, and Section 2.1 works out the examples of the trefoil knot and the figure-eight knot. Section 3 contains the 53 page table listing the knot Floer homology and \(\tau\) invariants, and Section 4 contains a discussion of the data in Section 3, including two conjectures based on the data.