arXiv · 2308.03324
Grid homology for spatial graphs and a K\"{u}nneth formula of connected sum
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.
Explore related subjects
Keep this discovery
Hajime Kubota. 2023-08-07. Grid homology for spatial graphs and a K\"{u}nneth formula of connected sum. https://arxiv.org/abs/2308.03324
Cite the original work for its findings. Save a collection to share your selection of sources.