2000 character limit reached
Combinatorial Proofs in Bordered Heegaard Floer homology
Published 13 May 2014 in math.GT | (1405.3004v2)
Abstract: Using bordered Floer theory, we give a combinatorial construction and proof of invariance for the hat version of Heegaard Floer homology. As a part of the proof, we also establish combinatorially the invariance of the linear-categorical representation of the strongly-based mapping class groupoid given by the same theory.
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.