arXiv · 1707.03424
A Bennequin-type inequality and combinatorial bounds
Abstract
In this paper we provide a new Bennequin-type inequality for the Rasmussen- Beliakova-Wehrli invariant, featuring the numerical transverse braid invariants (the c-invariants) introduced by the author. From the Bennequin type-inequality, and a combinatorial bound on the value of the c-invariants, we deduce a new computable bound on the Rasmussen invariant.
Explore related subjects
Keep this discovery
Carlo Collari. 2017-07-11. A Bennequin-type inequality and combinatorial bounds. https://doi.org/10.1307/mmj/1565402474
Cite the original work for its findings. Save a collection to share your selection of sources.