Papers
Topics
Authors
Recent
Search
2000 character limit reached

Braid Index Bounds Ropelength From Below

Published 30 Jan 2019 in math.GT | (1901.10663v1)

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

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.