Obstruction Complexes in Grid Homology

Abstract: Recently, Manolescu-Sarkar constructed a stable homotopy type for link Floer homology, which uses grid homology and accounts for all domains that do not pass through a specific square. In doing so, they produced an obstruction chain complex of the grid diagram with that square removed. We define the obstruction chain complex of the full grid, without the square removed, and compute its homology. Though this homology is too complicated to immediately extend the Manolescu-Sarkar construction, we give results about the existence of sign assignments in grid homology.