2000 character limit reached
Grid diagrams in Heegaard Floer theory
Published 14 Oct 2012 in math.GT and math.SG | (1210.3845v1)
Abstract: We review the use of grid diagrams in the development of Heegaard Floer theory. We describe the construction of the combinatorial link Floer complex, and the resulting algorithm for unknot detection. We also explain how grid diagrams can be used to show that the Heegaard Floer invariants of 3-manifolds and 4-manifolds are algorithmically computable (mod 2).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.