Abstract
Choose any oriented link type χ and closed braid representatives X +, X- of X-, where X- has minimal braid index among all closed braid representatives of χ. The main result of this paper is a 'Markov theorem without stabilization'. It asserts that there is a complexity function and a finite set of 'templates' such that (possibly after initial complexity-reducing modifications in the choice of X+ and X- which replace them with closed braids X′+, X′_) there is a sequence of closed braid representatives X′+ = X1 → X2 → ⋯ → Xr = X′_ such that each passage Xi → Xi+1 is strictly complexity reducing and non-increasing on braid index. The templates which define the passages Xi → X i+1 include 3 familiar ones, the destabilization, exchange move and flype templates, and in addition, for each braid index m ≥ 4 a finite set T (m) of new ones. The number of templates in T (m) is a non-decreasing function of m. We give examples of members of T(m), m ≥ 4, but not a complete listing. There are applications to contact geometry, which will be given in a separate paper [6].
| Original language | English |
|---|---|
| Pages (from-to) | 413-540 |
| Number of pages | 128 |
| Journal | Geometry and Topology |
| Volume | 10 |
| DOIs | |
| State | Published - Apr 27 2006 |
Fingerprint
Dive into the research topics of 'Stabilization in the braid groups I: MTWS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver