The warping degree of a link diagram
Author:
Preprint
Abstract
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D in the usual way. We show that d(D) + d(-D) + sr(D) is less than or equal to the crossing number of D, where -D denotes the inverse of D and sr(D) denotes the number of component subdiagrams which have at least one self-crossing. Moreover, we prove the condition of the equality. We also consider the minimal d(D)+d(-D)+sr(D) for all diagrams D. And for the warping degree and linking warping degree, we show some relations to the linking number, unlinking number, and the splitting number.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- THE WARPING DEGREE OF A KNOT DIAGRAMJournal of Knot Theory and Its Ramifications, 2010
- ASCENDING NUMBER OF KNOTS AND LINKSJournal of Knot Theory and Its Ramifications, 2010
- UNKNOTTING NUMBERS OF DIAGRAMS OF A GIVEN NONTRIVIAL KNOT ARE UNBOUNDEDJournal of Knot Theory and Its Ramifications, 2009
- A NOTE ON UNKNOTTING NUMBER, IIJournal of Knot Theory and Its Ramifications, 2005