arXiv · math/0609458
Slicing Bing doubles
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
David Cimasoni. 2009-07-06. Slicing Bing doubles. https://doi.org/10.2140/agt.2006.6.2395
Cite the original work for its findings. Save a collection to share your selection of sources.