2000 character limit reached
A combinatorial spanning tree model for knot Floer homology (1105.5199v3)
Published 26 May 2011 in math.GT and math.SG
Abstract: We iterate Manolescu's unoriented skein exact triangle in knot Floer homology with coefficients in the field of rational functions over $\mathbb{Z}/2\mathbb{Z}$. The result is a spectral sequence which converges to a stabilized version of delta-graded knot Floer homology. The $(E_2,d_2)$ page of this spectral sequence is an algorithmically computable chain complex expressed in terms of spanning trees, and we show that there are no higher differentials. This gives the first combinatorial spanning tree model for knot Floer homology.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.