Brunnian link: Difference between revisions
(explain) |
(add see also) |
||
| Line 11: | Line 11: | ||
Image:Three-triang-18crossings-Brunnian.gif|18-crossing link. |
Image:Three-triang-18crossings-Brunnian.gif|18-crossing link. |
||
</gallery> |
</gallery> |
||
==See also== |
|||
*[["Rubberband" Brunnian Links]] |
|||
==Links== |
==Links== |
||
Revision as of 10:55, 23 October 2007
A Brunnian link is a nontrivial link which becomes trivial if any component is removed. In other words, cutting any loop frees all the other loops (so that there is no Hopf link between any two loops).
The name Brunnian is after Hermann Brunn, whose 1892 article Über Verkettung included examples of such links.
The best-known and simplest possible Brunnian link is the Borromean rings, a link of three unknots. (This is also the only Brunnian link contained in tables which don't include links with 12 or more crossings.) However for every number three or above, there are an infinite number of links with the Brunnian property containing that number of loops. Here are some relatively simple three-component Brunnian links which are not the same as the Borromean rings:
12-crossing link.
18-crossing link.
