2000 character limit reached
Grid homology for spatial graphs and a Künneth formula of connected sum (2308.03324v3)
Published 7 Aug 2023 in math.GT and math.AT
Abstract: In this paper, we research the grid homology for spatial graphs with cut edges. We show that the grid homology for spatial graph $f$ is trivial if $f$ has sinks, sources, or cut edges. As an application, we give purely combinatorial proofs of some formulas including a K\"{u}nneth formula for the knot Floer homology of connected sums in the framework of the grid 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.
