A specious unlinking strategy (Q484579)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A specious unlinking strategy |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8415488600730896
0 references
0.7854484915733337
0 references
0.7766318321228027
0 references
0.769900381565094
0 references
0.7646486759185791
0 references
