Unknotting number and number of Reidemeister moves needed for unlinking (Q664710): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unknotting number and number of Reidemeister moves needed for unlinking |
scientific article |
Statements
Unknotting number and number of Reidemeister moves needed for unlinking (English)
0 references
2 March 2012
0 references
Using the unknotting number, the authors introduce a link diagram invariant similar to a knot invariant given in [\textit{T. Hass} and \textit{T. Nowik}, Math. Ann. 342, 125--137 (2008; Zbl 1161.57002)]. They give an example of an infinite sequence of diagrams of the trivial two-component link that need quadratic number of Reidemeister moves for being splitted with respect to the number of crossings.
0 references
link diagram
0 references
Reidemeister move
0 references
link diagram invariant
0 references
unknotting number
0 references
