Studying Links Via Closed Braids. V: The Unlink (Q3989199)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 34085
Language Label Description Also known as
default for all languages
No label defined
    English
    Studying Links Via Closed Braids. V: The Unlink
    scientific article; zbMATH DE number 34085

      Statements

      Studying Links Via Closed Braids. V: The Unlink (English)
      0 references
      0 references
      0 references
      28 June 1992
      0 references
      closed braid
      0 references
      Markov move
      0 references
      \(n\)-braid representative of the trivial \(r\)- component link
      0 references
      [For Parts I, II, IV and VI see Zbl 0724.57001, Zbl 0722.57001, Zbl 0711.57006 and Zbl 0739.57002, respectively.] The main theorem of this paper is the following: Theorem. Let \(K\) be an arbitrary closed \(n\)-braid representative of the trivial \(r\)-component link \(L\), \(r\geq 1\). Let \(U_ r\) be the standard closed \(r\)-braid representative of \(L\). Then there is a finite sequence of closed braid representatives of \(L\), \(K=K_ 0\to K_ 1\to K_ 2\to \cdots\to K_ m=U_ r\), such that each \(K_{i+1}\) is obtained from \(K_ i\) by one of the following moves: (1) a complexity-reducing exchange move, (2) a complexity-reducing deletion of a trivial loop, (3) a complexity- preserving isotopy in the complement of the axis. From this theorem, we observe that only exchange move that may change conjugacy class of representative is the only obstruction to reducing a closed \(n\)-braid representative of \(L\) to \(U_ r\).
      0 references

      Identifiers