BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Topological complexity: a product formula
DTSTART:20150512T140000
DTEND:20150512T150000
DTSTAMP:20260408T101643Z
UID:45f1e082199548b24e3ab7308e813ab0f7b3a7700117d2267ee8b009
CATEGORIES:Conferences - Seminars
DESCRIPTION:Paul-Eugène Parent (Ottawa)\nIn 2003\, Michael Farber introdu
 ced the notion of topological complexity TC(X) for the motion planning pro
 blem in robotics. In his words this non-negative integer TC(X) measures di
 scontinuity of the process of motion planning in the configuration space X
 . Very rapidly one notices that it is in fact a homotopy invariant which c
 an be very effectively studied using tools developed for the computation o
 f another homotopy invariant: the Lusternik-Schnirelmann category of a spa
 ce X.\nIn this talk\, we will give a small survey of recent results. Moreo
 ver\, while working over the rational numbers we will exhibit new computat
 ional examples (joint work with my student Gabrielle Poirier) and give a p
 roduct formula for an approximation to TC(X).
LOCATION:CM 09
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR