2000 character limit reached
Constructing and Cataloging 2-Adjacent Knots
Published 30 Sep 2025 in math.GT | (2510.00291v1)
Abstract: Generalizing unknotting number, -adjacent knots have 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 -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.
Paper Prompts
Sign up for free to create and run prompts on this paper.