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.

4,5
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.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

 The braid is associated with a planar graph.
The braid is associated with a planar graph.
 The 24 elements of a permutation group on 4 elements as braids. Note that all crossings shown are of the left-over-right type and other choices are possible. Changing the order of the operations can change the result, meaning that the operations are non-commutative. Indeed, the braid group on two or more strands is infinite.
The 24 elements of a permutation group on 4 elements as braids. Note that all crossings shown are of the left-over-right type and other choices are possible. Changing the order of the operations can change the result, meaning that the operations are non-commutative. Indeed, the braid group on two or more strands is infinite.

In topology, a branch of mathematics, braid theory is an abstract geometric theory studying the everyday braid concept, and some generalizations. The idea is that braids can be organized into groups, in which the group operation is 'do the first braid on a set of strings, and then follow it with a second on the twisted strings'.[citation needed] Such groups may be described by explicit presentations, as was shown by Emil Artin (1947). For an elementary treatment along these lines, see the article on braid groups. Braid groups are also understood by a deeper mathematical interpretation: as the fundamental group of certain configuration spaces.[1]

Braids and configuration spaces

To explain how to reduce a braid group in the sense of Artin to a fundamental group, we consider a connected manifold of dimension at least 2. The symmetric product of copies of means the quotient of , the -fold Cartesian product of by the permutation action of the symmetric group on strands operating on the indices of coordinates. That is, an ordered -tuple is in the same orbit as any other that is a re-ordered version of it.

A path in the -fold symmetric product is the abstract way of discussing points of , considered as an unordered -tuple, independently tracing out strings. Since we must require that the strings never pass through each other, it is necessary that we pass to the subspace of the symmetric product, of orbits of -tuples of distinct points. That is, we remove all the subspaces of defined by conditions for all . This is invariant under the symmetric group, and is the quotient by the symmetric group of the non-excluded -tuples. Under the dimension condition will be connected.

With this definition, then, we can call the braid group of with strings the fundamental group of (for any choice of base point – this is well-defined up to isomorphism). The case where is the Euclidean plane is the original one of Artin. In some cases it can be shown that the higher homotopy groups of are trivial.

Closed braids

When X is the plane, the braid can be closed, i.e., corresponding ends can be connected in pairs, to form a link, i.e., a possibly intertwined union of possibly knotted loops in three dimensions. The number of components of the link can be anything from 1 to n, depending on the permutation of strands determined by the link. A theorem of J. W. Alexander demonstrates that every link can be obtained in this way as the "closure" of a braid. Compare with string links.

Different braids can give rise to the same link, just as different crossing diagrams can give rise to the same knot. Markov (1935) describes two moves on braid diagrams that yield equivalence in the corresponding closed braids. A single-move version of Markov's theorem, was published by Lambropoulou & Rourke (1997).

Vaughan Jones originally defined his polynomial as a braid invariant and then showed that it depended only on the class of the closed braid.

The Markov theorem gives necessary and sufficient conditions under which the closures of two braids are equivalent links.[2]

Braid index

The "braid index" is the least number of strings needed to make a closed braid representation of a link. It is equal to the least number of Seifert circles in any projection of a knot.[3] Additionally, the "braid length" is the longest dimension of a braid.[4]

Applications

Braid theory has recently been applied to fluid mechanics, specifically to the field of chaotic mixing in fluid flows. The braiding of (2 + 1)-dimensional space-time trajectories formed by motion of physical rods, periodic orbits or "ghost rods", and almost-invariant sets has been used to estimate the topological entropy of several engineered and naturally occurring fluid systems, via the use of Nielsen–Thurston classification.[5]

See also

References

  1. ^ Artin, E. (1947). "Theory of Braids". Annals of Mathematics. 48 (1): 101–126. doi:10.2307/1969218. JSTOR 1969218. 
  2. ^ J. S. Birman, Knots, links, and mapping class groups, Annals of Math Study, no. 82, Princeton University Press (1974).
  3. ^ Weisstein, Eric W. (August 2014). "Braid Index". MathWorld – A Wolfram Web Resource. Retrieved 2014-08-06. 
  4. ^ Weisstein, Eric W. (August 2014). "Length". MathWorld – A Wolfram Web Resource. Retrieved 2014-08-06. 
  5. ^ Boyland, Aref & Stremler (2000); Gouillart, Thiffeault & Finn (2006); Stremler et al. (2011).

Notes

External links

This page was last edited on 18 June 2018, at 22:04
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.