arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0004183math.GT
收藏

Strongly n-trivial Knots

Hugh Howards, John Luecke

英文摘要:

A knot k is called ``strongly (n-1)-trivial.'' if there exists a projection of k, such that one can choose n crossings of the projection with the property that making the crossing changes corresponding to any of the $2^{n}-1$ nontrivial combinations of the selected crossings turns the original knot into the unknot. We prove that given any non-trivial knot k of genus g, k fails to be strongly n-trivial for all $n, n \geq 3g-1$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑