Wu experiment

From formulasearchengine
Jump to navigation Jump to search

Template:Orphan

In mathematics, topological complexity of a topological space X (also denoted by TC(X)) is a topological invariant closely connected to the motion planning problemTemplate:Elucidate, introduced by Michal Farber in 2003.

Definition

Let X be a topological space and PX={γ:[0,1]X} be the space of all continuous paths in X. Define the projection π:PXX×X by π(γ)=(γ(0),γ(1)). The topological complexity is the minimal number k such that

Examples

  • The topological complexity: TC(X) = 1 if and only if X is contractible.
  • The topological complexity of the sphere Sn is 2 for n odd and 3 for n even. For example, in the case of the circle S1, we may define a path between two points to be the geodesics, if it is unique. Any pair of antipodal points can be connected by a counter-clockwise path.
  • If F(m,n) is the configuration space of n distinct points in the Euclidean m-space, then
TC(F(m,n))={2n1formodd2n2formeven.
  • For the Klein bottle, the topological complexity is not known (July 2012).

References


Template:Topology-stub