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

From MaRDI portal
Publication:3522336

DOI10.1090/S0002-9939-08-09529-4zbMATH Open1151.55004arXiv0706.2497OpenAlexW2963351649MaRDI QIDQ3522336FDOQ3522336


Authors: Mark Grant, Michael Farber Edit this on Wikidata


Publication date: 1 September 2008

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0706.2497




Recommendations




Cites Work


Cited In (32)





This page was built for publication: Robot motion planning, weights of cohomology classes, and cohomology operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522336)