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

套索链环的完全分裂数

The complete splitting number of a lassoed link

Ayaka Shimizu

摘要:

在本文中,我们定义了一个套索上的链接,一个本地添加的平凡结的链接。设K是一个s-分量链路,其Conway多项式不为零。设L是由K通过r-迭代套索得到的链环。完全分裂数split(L)大于或等于r+s-1,且小于或等于r+split(K)。特别地,我们从一个纽结通过r-迭代分量套索得到一个代数上完全可裂的链环L,其中split(L)=r。此外,我们构造了一个链路L,其解链数大于split(L)。

英文摘要:

In this paper, we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete splitting number split(L) is greater than or equal to r+s-1, and less than or equal to r+split(K). In particular, we obtain from a knot by r-iterated component-lassoings an algebraically completely splittable link L with split(L)=r. Moreover, we construct a link L whose unlinking number is greater than split(L).

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

↑