A specious unlinking strategy (Q484579)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A specious unlinking strategy |
scientific article |
Statements
A specious unlinking strategy (English)
0 references
7 January 2015
0 references
In this short paper, the authors give a negative answer to the following question: ``Is the following always the most efficient strategy for unlinking? First split the link with the minimal number of crossing changes, and then unknot the resulting knots.'' They construct a counterexample with a 3-component link with unlinking number 2 and splitting number 1, but after splitting by one crossing change, one needs at least two crossing changes to unknot the components.
0 references
link
0 references
crossing change
0 references
unlinking number
0 references
splitting number
0 references
