The OU number and Reidemeister moves of type III for link diagrams

Abstract

We introduce the non-self OU sequence and the OU number for link diagrams. Using these, we give a lower bound for the number of necessary Reidemeister moves of type III between two diagrams of the same link.