Deciding strong quasipositivity and quasipositivity

We present two results concerning the decidability of (strong) quasipositivity of links in the 3-sphere. First, using a result of Dynnikov–Prasolov, we provide an algorithm to decide whether or not a link is strongly quasipositive. Second, we reduce the decision problem of the quasipositivity of links to that of braids.