Abstract
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 .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.