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

Pretzel knots up to nine crossings

R. Díaz, P. M. G. Manchón

英文摘要:

There are infinitely many pretzel links with the same Alexander polynomial (actually with trivial Alexander polynomial). By contrast, in this note we revisit the Jones polynomial of pretzel links and prove that, given a natural number S, there is only a finite number of pretzel links whose Jones polynomials have span S. More concretely, we provide an algorithm useful for deciding whether or not a given knot is pretzel. As an application we identify all the pretzel knots up to nine crossings, proving in particular that $8_{12}$ is the first non-pretzel knot.

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

↑