Slicing Bing doubles
英文摘要:
Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if B(K) is boundary slice, then K is algebraically slice. We also show that the Rasmussen invariant can tell that certain Bing doubles are not smoothly slice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。