Constructing and Cataloging 2-Adjacent Knots
John Carney, Everett Meike
公開日: 2025/9/30
Abstract
Generalizing unknotting number, $n$-adjacent knots have $n$ 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 $d$-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.