2000 character limit reached
Rational tangle replacements and knot Floer homology
Published 17 Mar 2022 in math.GT and math.AT | (2203.09319v1)
Abstract: From the link Floer complex of a link $K$, we extract a lower bound $t_q'(K)$ for the rational unknotting number of $K$ (i.e. the minimum number of rational replacements required to unknot $K$). Moreover, we show that the torsion obstruction $t_q(K)=\hat{t}(K)$ from an earlier paper of Alishahi and the author is a lower bound for the proper rational unknotting number. Moreover, $t_q(K#K')=\max{t_q(K),t_q(K')}$ and $t'q(K#K')=\max{t'_q(K),t'_q(K')}$. For the torus knot $K=T{p,pk+1}$ we compute $t'_q(K)=\lfloor p/2\rfloor$ and $t_q(K)=p-1$.
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.