arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/9912006math.GT
收藏

Brunnian环由它们的补数决定

Brunnian links are determined by their complements

Brian Mangum, Theodore Stanford

摘要:

若L_1和L_2是两个两两环绕数均为0的Brunnian环,则证明了L_1和L_2等价的充要条件是它们有同胚补.特别是,这适用于所有至少有三个组件的Brunnian链接。若L_1是一个两两环绕数均为0的Brunnian环,且L_2的补与L_1的补同胚,则我们证明了L_2可以由L_1通过围绕非纽结分支的一系列扭而得到.最后,我们表明,对于任何正整数n,一个算法用于检测一个n-组件的解链立即导致一个算法用于检测任何数量的组件的解链。这种算法的推广在概念上是简单的,但在计算上可能是不切实际的。

英文摘要:

If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three components. If L_1 is a Brunnian link with all pairwise linking numbers 0, and the complement of L_2 is homeomorphic to the complement of L_1, then we show that L_2 may be obtained from L_1 by a sequence of twists around unknotted components. Finally, we show that for any positive integer n, an algorithm for detecting an n-component unlink leads immediately to an algorithm for detecting an unlink of any number of components. This algorithmic generalization is conceptually simple, but probably computationally impractical.

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

↑