Topological complexity

From testwiki
Revision as of 05:11, 8 April 2024 by 153.90.20.47 (talk)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description 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 Michael 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 geodesic between the points, 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))={2n1for𝑚odd2n2for𝑚even.

References

Template:Reflist

  • Template:Cite news
  • Armindo Costa: Topological Complexity of Configuration Spaces, Ph.D. Thesis, Durham University (2010), online

Template:Topology-stub

ko:단면 범주#위상 복잡도