SearcharxivSearch

arXiv subjects

Eric Staron

Publications and source records attributed to Eric Staron.

2 recordsLinked to original sources

The $n$-adjacency graph for knots

A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors define a new graph $\Gamma_n$ to represent $n$-adjacency relationships between knots. We prove several results about this new object.

math.GT

Pretzel Knots with Unknotting Number One

We provide a partial classification of the 3-strand pretzel knots $K = P(p,q,r)$ with unknotting number one. Following the classification by Kobayashi and Scharlemann-Thompson for all parameters odd, we treat the remaining families with $r$ even. We discover that there are only four possible subfamilies which may satisfy $u(K) = 1$. These families are determined by the sum $p+q$ 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áth and Szabó. 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 $P(p,q,r)$ with unknotting number one that are not 2-bridge knots are $P(3,-3,2)$ and its reflection.

math.GT