The warping degree of a link diagram

From MaRDI portal
Publication:531285

zbMATH Open1248.57007arXiv0905.0008MaRDI QIDQ531285FDOQ531285


Authors: Ayaka Shimizu Edit this on Wikidata


Publication date: 29 April 2011

Published in: Osaka Journal of Mathematics (Search for Journal in Brave)

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. 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 components which have at least one self-crossing. Moreover, we give a necessary and sufficient condition for the equality. We also consider the minimal d(D)+d(-D)+sr(D) for all diagrams D. For the warping degree and linking warping degree, we show some relations to the linking number, unknotting number, and the splitting number.


Full work available at URL: https://arxiv.org/abs/0905.0008




Recommendations




Cites Work


Cited In (12)





This page was built for publication: The warping degree of a link diagram

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531285)