Pretzel Knots with Unknotting Number One
Dorothy Buck, Julian Gibbons, Eric Staron

TL;DR
This paper classifies 3-strand pretzel knots with unknotting number one, focusing on cases with even r, and identifies specific families that satisfy this property, using advanced topological tools.
Contribution
It extends the classification of pretzel knots with unknotting number one by analyzing cases with even r and identifying potential exceptions.
Findings
Only four subfamilies of pretzel knots may have unknotting number one.
The problem is resolved for two of these subfamilies.
Conjecture that only specific non-2-bridge pretzel knots have unknotting number one.
Abstract
We provide a partial classification of the 3-strand pretzel knots with unknotting number one. Following the classification by Kobayashi and Scharlemann-Thompson for all parameters odd, we treat the remaining families with even. We discover that there are only four possible subfamilies which may satisfy . These families are determined by the sum and their signature, and we resolve the problem in two of these cases. Ingredients in our proofs include Donaldson's diagonalisation theorem (as applied by Greene), Nakanishi's unknotting bounds from the Alexander module, and the correction terms introduced by Ozsv\'ath and Szab\'o. Based on our results and the fact that the 2-bridge knots with unknotting number one are already classified, we conjecture that the only 3-strand pretzel knots with unknotting number one that are not 2-bridge knots are…
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.
