Representation of links by braids: A new algorithm (Q916146): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Hugh R. Morton / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hugh R. Morton / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:36, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Representation of links by braids: A new algorithm |
scientific article |
Statements
Representation of links by braids: A new algorithm (English)
0 references
1990
0 references
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.
0 references
oriented link
0 references
closed braid
0 references
Seifert circles
0 references
