A Simplification of Combinatorial Link Floer Homology
classification
🧮 math.GT
math.SG
keywords
combinatorialfloerhomologylinkcomplexcomputingdefinemanolescu-ozsvath-sarkar
read the original abstract
We define a new combinatorial complex computing the hat version of link Floer homology over Z/2Z, which turns out to be significantly smaller than the Manolescu-Ozsvath-Sarkar one.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.