Robot motion planning, weights of cohomology classes, and cohomology operations

Details Robot motion planning, weights of cohomology classes, and cohomology operations Robot motion planning, weights of cohomology classes, and cohomology operations

2007-06-17

arxiv.org/abs/0706.2497v2

Mathematics

Algebraic Topology

10 pages; Revised version (changes only in section 5)

Scientific paper

The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X. In this paper we show how cohomology operations can be used to sharpen these lower bounds for TC(X). As an application of this technique we calculate explicitly the topological complexity of various lens spaces. The results of the paper were inspired by the work of E. Fadell and S. Husseini on weights of cohomology classes appearing in the classical lower bounds for the Lusternik - Schnirelmann category. In the appendix to this paper we give a very short proof of a generalized version of their result.

Affiliated with

Also associated with

No associations

Rating

Robot motion planning, weights of cohomology classes, and cohomology operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robot motion planning, weights of cohomology classes, and cohomology operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robot motion planning, weights of cohomology classes, and cohomology operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332466