Serge Tabachnikov
(Pennsylvania State University)
Complexity of the motion planning problem in the real projective space
Abstract: I will define the topological complexity of the motion problem. The computation of the complexity of the motion problem in the real projective space is proved to be equivalent to the immersion problem of the real projective space to vector space.
The talk is based on joint work with M. Farber (Tel Aviv University) and S. Yuzvinsky (University of Oregon).