Slicing Bing doubles
几何拓扑
2009-07-06 v2
摘要
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.
关键词
引用
@article{arxiv.math/0609458,
title = {Slicing Bing doubles},
author = {David Cimasoni},
journal= {arXiv preprint arXiv:math/0609458},
year = {2009}
}
备注
This is the version published by Algebraic & Geometric Topology on 13 December 2006