In knot theory, a branch of topology, a Brunnian link is a nontrivial link that becomes a set of trivial unlinked circles if any one component is removed. In other words, cutting any loop frees all the other loops (so that no two loops can be directly linked).
The name Brunnian is after Hermann Brunn. Brunn's 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. 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:
Image:Brunnian-3-not-Borromean.svg|12-crossing link.
Image:Three-triang-18crossings-Brunnian.svg|18-crossing link.
Image:Three-interlaced-squares-Brunnian-24crossings.svg|24-crossing link.
The simplest Brunnian link other than the 6-crossing Borromean rings is presumably the 10-crossing L10a140 link.
An example of an n-component Brunnian link is given by the "rubberband" Brunnian Links, where each component is looped around the next as aba−1b−1, with the last looping around the first, forming a circle.
In 2020, new and much more complicated Brunnian links have been discovered in using highly flexible geometric-topology methods, far more than having been previously constructed. See Section 6.
It is impossible for a Brunnian link to be constructed from geometric circles. Somewhat more generally, if a link has the property that each component is a circle and no two components are linked, then it is trivial. The proof, by Michael Freedman and Richard Skora, embeds the three-dimensional space containing the link as the boundary of a Poincaré ball model of four-dimensional hyperbolic space, and considers the hyperbolic convex hulls of the circles. These are two-dimensional subspaces of the hyperbolic space, and their intersection patterns reflect the pairwise linking of the circles: if two circles are linked, then their hulls have a point of intersection, but with the assumption that pairs of circles are unlinked, the hulls are disjoint.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Explores the design and synthesis of interlocked molecules like catenanes and rotaxanes, along with the structural and symbolic significance of knots and Borromean rings.
In mathematical knot theory, the Hopf link is the simplest nontrivial link with more than one component. It consists of two circles linked together exactly once, and is named after Heinz Hopf. A concrete model consists of two unit circles in perpendicular planes, each passing through the center of the other. This model minimizes the ropelength of the link and until 2002 the Hopf link was the only link whose ropelength was known. The convex hull of these two circles forms a shape called an oloid.
In knot theory, an area of mathematics, the link group of a link is an analog of the knot group of a knot. They were described by John Milnor in his Ph.D. thesis, . Notably, the link group is not in general the fundamental group of the link complement. The link group of an n-component link is essentially the set of (n + 1)-component links extending this link, up to link homotopy. In other words, each component of the extended link is allowed to move through regular homotopy (homotopy through immersions), knotting or unknotting itself, but is not allowed to move through other components.
In mathematical knot theory, a link is a collection of knots which do not intersect, but which may be linked (or knotted) together. A knot can be described as a link with one component. Links and knots are studied in a branch of mathematics called knot theory. Implicit in this definition is that there is a trivial reference link, usually called the unlink, but the word is also sometimes used in context where there is no notion of a trivial link.
In this short note, we derive the large deviations estimate of the tail of the buffer occupancy distribution in a communications link with a very general integrated Poisson shot noise model for the total input. The result is obtained by a straightforward a ...
We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate first-order invariants containing alternations of quantifiers. The method is based on ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009
For positive integers w and k, two vectors A and B from Z(w) are called k-crossing if there are two coordinates i and j such that A[i] - B[i] >= k and B[j] - A[j] >= k. What is the maximum size of a family of pairwise 1-crossing and pairwise non-k-crossing ...