2000 character limit reached
Ribbon distance bounds from Bar-Natan Homology and $α$-Homology
Published 2 Nov 2020 in math.GT | (2011.01190v1)
Abstract: We prove a lower bound on the ribbon distance via Bar-Natan Homology. This lower bound agrees with Alishahi's lower bound on the unknotting number via Bar-Natan Homology, which furthers a pattern first observed by Sarkar: Sarkar's lower bound on the ribbon distance via Lee Homology agreed with Alishahi and Dowlin's lower bound on the unknotting number via Lee Homology. We also prove a lower bound on the ribbon distance via $\alpha$-homology, a variant of Khovanov homology defined recently by Khovanov and Robert.
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.