Abstract
We show that the volume of any Montesinos link can be bounded above and below in terms of the combinatorics of its diagram. This was known for Montesinos links with at most two tangles, and those with at least five tangles. We complete the result for the remaining cases.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.