Unknotting number and number of Reidemeister moves needed for unlinking

AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Nowik (2008) [4], which changes at most by 2 under a Reidemeister move. We show that a certain infinite sequence of diagrams of the trivial two-component link need quadratic number of Reidemeister moves for being splitted with respect to the number of crossings