Recognizing trivial links in polynomial time
Geometric Topology
2013-02-28 v3
Abstract
Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure progress toward a trivial embedding. In conjunction with a modified form of arc presentations of links, we obtain a strictly monotonic, deterministic algorithm that recognizes triviality in links within polynomial time and space.
Cite
@article{arxiv.1110.2871,
title = {Recognizing trivial links in polynomial time},
author = {Chad Musick},
journal= {arXiv preprint arXiv:1110.2871},
year = {2013}
}
Comments
This paper has been withdrawn until the proof can be clarified and verified