A note on knot Floer thickness and the dealternating number

2022/05/17 by Truong, Linh
#57K10 #57K18 #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.2205.08097

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-Szabo approach using Kauffman states to show that thickness bounds the minimal number of bad domains in a knot diagram.

Related

• Computation of the knot Floer complex of knots of thickness one
• Knots of low knot Floer width
• A note on the nearly additivity of knot width
• Cable knots are not thin
• An introduction to knot Floer homology and curved bordered algebras