Stabilization in the braid groups I: MTWS

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is the version published by Geometry & Topology on 27 April 2006; part II (arXiv:math/0310280) is also published in GT vo

Scientific paper

10.2140/gt.2006.10.413

Choose any oriented link type X and closed braid representatives X[+], X[-] of X, where X[-] has minimal braid index among all closed braid representatives of X. 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[+]' = X^1->X^2->...->X^r = X[-]' such that each passage X^i->X^i+1 is strictly complexity reducing and non-increasing on braid index. The templates which define the passages X^i->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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Stabilization in the braid groups I: MTWS does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stabilization in the braid groups I: MTWS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stabilization in the braid groups I: MTWS will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-486388

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.