Representation of links by braids: A new algorithm
type: Item
instance of: scholarly article
title: Representation of links by braids: A new algorithm
zbMATH Open document ID: 0703.57004
DOI: 10.1007/BF02566597
author: Pierre Vogel
published in: Commentarii Mathematici Helvetici
publication date: 1990-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/140186
review text: Alexander's classical result shows that any oriented link can be presented as a closed braid. There have been a number of recent proofs of this result aimed at controlling the `complexity' of the braid in terms of the initial diagram of the link. The author presents a very simple and economical algorithm, which does not increase the number of Seifert circles, and which heavily limits the increase in the number of crossings. The elegant combinatorial proof is based on an analysis of the dual graph constructed from the dissection of the plane by the Seifert circles.
Mathematics Subject Classification ID: 57M25
zbMATH DE Number: 4153479
zbMATH Keywords: oriented link
zbMATH Keywords: closed braid
zbMATH Keywords: Seifert circles
reviewed by: H. R. Morton
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4153479