2000 character limit reached
A graph TQFT for hat Heegaard Floer homology
Published 19 Mar 2015 in math.GT | (1503.05846v3)
Abstract: We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juh\'{a}sz's sutured Floer TQFT. We compute the maps for several elementary graph cobordisms. As an application, we compute the action of the fundamental group on hat Heegaard Floer homology.
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.