Hostname: page-component-848d4c4894-8bljj Total loading time: 0 Render date: 2024-06-22T22:08:39.779Z Has data issue: false hasContentIssue false

Embedding knots and links in an open book III. On the braid index of satellite links

Published online by Cambridge University Press:  01 January 1999

IAN J. NUTT
Affiliation:
Department of Pure Mathematics, University of Liverpool, P.O. Box 147, Liverpool L69 3BX

Abstract

Let VS3 be a solid, knotted torus. Through the work of Birman and Menasco [2], the observation has been made that a satellite link L=C[midast ]PV (with companion C, pattern P and essential torus T=∂V) falls into one of two broad categories: reverse string and non-reverse string. These categories are borne of the three embedding types identified in [2] and are distinguished by the existence of, or lack of, a meridional disc DV with an orientation, whose point-intersections with the oriented satellite C[midast ]P are all similarly oriented. If no such D exists, then L is said to be a reverse string satellite.

If C[midast ]P is a non-reverse string satellite, it is known that the braid index b(C[midast ]P) is dependent only on b(C) and certain specified properties of the pattern and not on the choice fZ of framing parameter. In [2] it is conjectured that, if C[midast ]fP is a reverse string satellite (in which the framing parameter is f), the braid index b(C[midast ]fP) depends on the arc index α(C), properties of the pattern and also the framing. We study this dependence further via established upper and lower bounds for braid index. The upper bound comes from explicit closed braid diagrams of L, for which constructions are shown. The lower bound comes from the Homfly polynomial, via the Morton–Franks–Williams inequality [5, 8]. We will prove the following theorem.

Type
Research Article
Copyright
The Cambridge Philosophical Society 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)