加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本