Braid index bounds ropelength from below

From MaRDI portal
Publication:5111676

DOI10.1142/S0218216520500194zbMATH Open1439.57009arXiv1901.10663MaRDI QIDQ5111676FDOQ5111676


Authors: Y. Diao Edit this on Wikidata


Publication date: 27 May 2020

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Abstract: For an un-oriented link mathcalK, let L(mathcalK) be the ropelength of mathcalK. It is known that when mathcalK has more than one component, different orientations of the components of mathcalK may result in different braid index. We define the largest braid index among all braid indices corresponding to all possible orientation assignments of mathcalK the {em absolute braid index} of mathcalK and denote it by extbfB(mathcalK). In this paper, we show that there exists a constant a>0 such that L(mathcalK)geaextbfB(mathcalK) for any mathcalK, {em i.e.}, the ropelength of any link is bounded below by its absolute braid index (up to a constant factor).


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




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Braid index bounds ropelength from below

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