arXiv Analytics

Sign in

arXiv:0809.1334 [math.GT]AbstractReferencesReviewsResources

The warping degree of a knot diagram

Ayaka Shimizu

Published 2008-09-08, updated 2009-06-02Version 4

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.

Comments: 12 pages, 9 figures
Categories: math.GT
Related articles: Most relevant | Search more
arXiv:0905.0008 [math.GT] (Published 2009-05-01, updated 2009-12-27)
The warping degree of a link diagram
arXiv:2101.09072 [math.GT] (Published 2021-01-22)
Lower bounds for the warping degree of a knot projection
arXiv:1109.5898 [math.GT] (Published 2011-09-27, updated 2011-12-09)
The warping polynomial of a knot diagram