分野別セミナー

【講演要旨】The parametrized topological complexity is a variant of the topological complexity that is defined on a
fibration p\colon X\to B. It was first introduced by Cohen, Farber and Weinberger to formulate the robot motion
planning problem which involves external constraints. In this talk, we will consider the rationalization of this
invariant, which is characterized in terms of a relative Sullivan model of p\colon X\to B. We will give some upper and
lower bounds for the rational parametrized topological complexity. We will also mention a variant of the TC-
generating function conjecture introduced by Farber and Oprea.