加载中…
From the link Floer complex of a link , we extract a lower bound for the rational unknotting number of (i.e. the minimum number of rational replacements required to unknot ). Moreover, we show that the torsion obstruction from an earlier paper of Alishahi and the author is a lower bound for the proper rational unknotting number. Moreover, and . For the torus knot we compute and .

生成讲解博客的中文版本

生成AI智能校验的中文版本