Rational tangle replacements and knot Floer homology
Eaman Eftekhary

TL;DR
This paper introduces new lower bounds for the rational unknotting number of links using knot Floer homology, computes these bounds for certain torus knots, and explores their properties under knot operations.
Contribution
It defines and analyzes lower bounds for the rational unknotting number derived from link Floer complexes, including explicit calculations for specific torus knots.
Findings
Lower bounds for rational unknotting number from Floer homology
Explicit bounds for torus knots T_{p,pk+1}
Behavior of bounds under connected sum operations
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Botulinum Toxin and Related Neurological Disorders · Biochemical and Structural Characterization
