arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9903055math.GTmath.QA

On the z-degree of the Kauffman polynomial of a tangle decomposition

Mark E. Kidwell, Theodore B. Stanford

英文摘要:

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational tangles.

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

↑