A combinatorial representation of links by quasitoric braids (Q1348747): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/eujc.2001.0546 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1970850313 / rank | |||
Normal rank |
Revision as of 20:13, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial representation of links by quasitoric braids |
scientific article |
Statements
A combinatorial representation of links by quasitoric braids (English)
0 references
28 August 2002
0 references
According to Alexander's theorem, every link admits a representation by a closed braid. Markov proved that two braids \(\alpha\) and \(\beta\) represent the same link if and only if \(\alpha\) can be transformed to \(\beta\) by using a sequence of local transformations called Markov moves. In the present paper, the author introduces the notion of quasitoric braids and shows that all link isotopy classes can be encoded by quasitoric braids. It is worth mentioning that quasitoric braids represent a very small class of braids that forms a subgroup of the braid group. This subgroup contains the pure braids.
0 references
pure braids
0 references