Links and Hurwitz curves
classification
🧮 math.GT
math.SG
keywords
boundeulerlinknumberbennequinbraidclosedconjecture
read the original abstract
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.
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.