A Bennequin-type inequality and combinatorial bounds

TL;DR

This paper introduces a new Bennequin-type inequality for the Rasmussen-Beliakova-Wehrli invariant, providing a computable bound on the Rasmussen invariant using combinatorial bounds on c-invariants.

Contribution

It presents a novel inequality linking the Rasmussen-Beliakova-Wehrli invariant with transverse braid invariants, enabling new computable bounds on the Rasmussen invariant.

Findings

Established a new Bennequin-type inequality for the invariant.

Derived a combinatorial bound on c-invariants.

Provided a new computable bound on the Rasmussen invariant.

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.