加载中…
In the note, we give a proof, based on the Generalized Thom Conjecture, of Bennequin’s Theorem on upper bound for the Euler number of a link which is considered as a closed braid. A lower bound for the Euler number of a link is also given.

生成讲解博客的中文版本

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