A specious unlinking strategy
classification
🧮 math.GT
keywords
changescrossingstrategyunlinkingalwayscomponentsfirstfollowing
read the original abstract
We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.