2000 character limit reached
Divisibility of great webs and reducible Dehn surgery
Published 13 Oct 2014 in math.GT | (1410.3442v1)
Abstract: We use the combinatorial techniques of graphs of intersection to study reducible Dehn surgeries on knots in the three-sphere. In particular, in the event that a reducible surgery on a knot K in the three-sphere of slope r produces a manifold with more than two connected summands, we show that r is bounded in absolute value by the bridge number of K. As a consequence, this possibility is ruled out for knots with bridge number at most five and for positive braid closures.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.