Click here to flash read.
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 a purely
combinatorial proof of a K\"{u}nneth formula for the knot Floer homology of
connected sums in the framework of the grid homology.
Click here to read this post out
ID: 339266; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: Aug. 22, 2023, 7:33 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 10
CC:
No creative common's license
No creative common's license
Comments: