Volumes of Montesinos links
classification
🧮 math.GT
keywords
montesinoslinkstanglesabovebelowboundedcasescombinatorics
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.