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

On the complexity of torus knot recognition

John A. Baldwin, Steven Sivek

英文摘要:

We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class ${\sf NP} \cap {\sf co\text{-}NP}$, assuming the generalized Riemann hypothesis. We also show that satellite knot detection is in ${\sf NP}$ under the same assumption, and that cabled knot detection and composite knot detection are unconditionally in ${\sf NP}$. Our algorithms are based on recent work of Kuperberg and of Lackenby on detecting knottedness.

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

↑