2000 character limit reached
On sign assignments in link Floer homology
Published 6 Dec 2018 in math.GT | (1812.02374v1)
Abstract: In this short note, we compare the combinatorial sign assignment of Manolescu, Ozsvath, Szabo and Thurston for grid homology of knots and links in 3-sphere with the sign assignment coming from a coherent system of orientations on Whitney disks. Although these constructions produce different signs, a small modification of the convention in either of the two methods results in identical sign assignments, and thus identical chain complexes.
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.