Papers
Topics
Authors
Recent
Search
2000 character limit reached

The quasi-isomorphism class of the Kakimizu complex

Published 16 Feb 2016 in math.GT | (1602.05062v2)

Abstract: It has been shown that the Kakimizu complex of a knot is quasi-isomorphic to $\mathbb{Z}n$ for some $n \geq 0$. We give a lower bound on $n$, matching the upper bound previously given.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up