<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Unknot - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=unknot&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=unknot&amp;p=7">3.Next</a>
</p>
<p>are not known to be efficiently computable for this purpose.  It is not known whether the Jones polynomial or <a href="page.php?w=finite_type_invariant">finite type invariant</a>s can detect the unknot.</p>

<p><big> Examples </big></p>
<p>It can be difficult to find a way to untangle string even though the fact it started out untangled proves the task is possible.  Thistlethwaite and Ochiai provided many examples of diagrams of unknots that have no obvious way to simplify them, requiring one to temporarily increase the diagram's <a href="page.php?w=crossing_number_%28knot_theory%29">crossing number</a>.</p><p>
<a accesskey="1" href="page.php?w=unknot&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=unknot&amp;p=7">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
