Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructing and Cataloging 2-Adjacent Knots

Published 30 Sep 2025 in math.GT | (2510.00291v1)

Abstract: Generalizing unknotting number, nn-adjacent knots have nn crossings such that changing any non-empty subset of them results in the unknot. In this paper, we determine the 2-adjacent knots through 12 crossings. Using Heegaard Floer dd-invariants and the Alexander polynomial, we develop a new technique to obstruct 2-adjacency, and we prove conjectures of Ito and Kato regarding 2-adjacent knots.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.