Untangling trigonal diagrams

Let $K$ be a link of Conways normal form $C(m)$, $m geq 0$, or $C(m,n)$ with $mntextgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all intermediate diagrams remain trigonal, and the number of crossings never increases.

On the lexicographic degree of two-bridge knots

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp lower bound for the lexicographic degree of any knot, using real polynomial curves properties.