The warping degree of a knot diagram
classification
🧮 math.GT
keywords
diagramcrossingdegreeknotnumberwarpingalternatingchanges
read the original abstract
For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing number of D. Moreover the equality holds if and only if D is an alternating diagram.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.