To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

From Wikipedia, the free encyclopedia

Two simple diagrams of the unknot
Two simple diagrams of the unknot

In the mathematical theory of knots, the unknot, or trivial knot, is the least knotted of all knots. Intuitively, the unknot is a closed loop of rope without a knot tied into it. To a knot theorist, an unknot is any embedded topological circle in the 3-sphere that is ambient isotopic (that is, deformable) to a geometrically round circle, the standard unknot.

The unknot is the only knot that is the boundary of an embedded disk, which gives the characterization that only unknots have Seifert genus 0. Similarly, the unknot is the identity element with respect to the knot sum operation.

Unknotting problem

Deciding if a particular knot is the unknot was a major driving force behind knot invariants, since it was thought this approach would possibly give an efficient algorithm to recognize the unknot from some presentation such as a knot diagram. Unknot recognition is known to be in both NP and co-NP.

It is known that knot Floer homology and Khovanov homology detect the unknot, but these are not known to be efficiently computable for this purpose. It is not known whether the Jones polynomial or finite type invariants can detect the unknot.


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 crossing number.

While rope is generally not in the form of a closed loop, sometimes there is a canonical way to imagine the ends being joined together. From this point of view, many useful practical knots are actually the unknot, including those that can be tied in a bight.[1]

Every knot can be represented as a linkage, which is a collection of rigid line segments connected by universal joints at their endpoints. The stick number is the minimal number of segments needed to represent a knot as a linkage, and a stuck unknot is a particular unknotted linkage that cannot be reconfigured into a flat convex polygon.[2] Like crossing number, a linkage might need to be made more complex by subdividing its segments before it can be simplified.


The Alexander–Conway polynomial and Jones polynomial of the unknot are trivial:

No other knot with 10 or fewer crossings has trivial Alexander polynomial, but the Kinoshita–Terasaka knot and Conway knot (both of which have 11 crossings) have the same Alexander and Conway polynomials as the unknot. It is an open problem whether any non-trivial knot has the same Jones polynomial as the unknot.

The unknot is the only knot whose knot group is an infinite cyclic group, and its knot complement is homeomorphic to a solid torus.

See also


  1. ^ Volker Schatz. "Knotty topics". Archived from the original on 2011-07-17. Retrieved 2007-04-23.
  2. ^ Godfried Toussaint (2001). "A new class of stuck unknots in Pol-6" (PDF). Contributions to Algebra and Geometry. 42 (2): 301–306. Archived from the original (PDF) on 2003-05-12.

External links

This page was last edited on 7 November 2021, at 16:38
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.