一个阻碍切片迭代必应双打
An obstruction to slicing iterated Bing doubles
摘要：
设K是S^3中的一个纽结。本文研究了K的迭代Bing双树，给出了如下命题的新证明：如果BD_n（K）对某个n是切片的，则K是代数切片的.这个结果首先由Cha和Kim使用覆盖链演算证明。我们也使用这个工具，但我们的证明要简单得多，并阐明了几个概括。
英文摘要：
Let K be a knot in S^3. We study the iterated Bing doubles of K, giving a new proof for the following statement: If BD_n(K) is slice for some n, then K is algebraically slice. This result was first proved by Cha and Kim using covering link calculus. We also use this tool, but our proof is substantially simpler and illuminates several generalizations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
