2000 character limit reached
The Kakimizu complex of a split link
Published 29 Nov 2012 in math.GT | (1211.7035v1)
Abstract: We study the Kakimizu complex of a split link. As part of this, we also study Seifert surfaces and the Kakimizu complex for a non-split link in a 3-ball. In addition, we show that a simplex of the Kakimizu complex of a non-split link can be realised in an essentially unique way.
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.