Abstract
In this note, we give a short proof that knot Floer thickness is a lower bound on the dealternating number of a knot. The result is originally due to work of Abe and Kishimoto, Lowrance, and Turaev. Our proof is a modification of the Stipsicz-Szabó approach using Kauffman states to show that thickness bounds the minimal number of bad domains in a knot diagram.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have