Abstract
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant T C ( X ) \mathrm {TC}(X) of the configuration space X X of the system. Previously known lower bounds for T C ( X ) \mathrm {TC}(X) use the structure of the cohomology algebra of X X . In this paper we show how cohomology operations can be used to sharpen these lower bounds for T C ( X ) \mathrm {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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
