2000 character limit reached
On the fibration of augmented link complements
Published 14 Sep 2011 in math.GT | (1109.3084v2)
Abstract: We study the fibration of augmented link complements. Given the diagram of an augmented link we associate a spanning surface and a graph. We then show that this surface is a fiber for the link complement if and only if the associated graph is a tree. We further show that fibration is preserved under Dehn filling on certain components of these links. This last result is then used to prove that within a very large class of links, called locally alternating augmented links, every link is fibered.
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.