BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Computational aspects of (persistent) homology. From discrete to c
 ontinuous and back.
DTSTART:20140321T141500
DTEND:20140321T153000
DTSTAMP:20260511T085637Z
UID:06b3ad9bf4e5a221944b8b8eafe2dfc8463784c22209c696e22fbdea
CATEGORIES:Conferences - Seminars
DESCRIPTION:Pawel Dlotko\nComputational topology is a branch of a computat
 ional mathematics - a new discipline emerging in between mathematics and c
 omputer science and aiming in obtaining mathematical rigorous results with
  a help of computer. Recently computational topology gain a lot of attenti
 on in various fields outside mathematics. I will start this talk by summar
 izing some of those applications. Later the concept of\npersistent homolog
 y will be explained and the algorithm(s) to compute it for a finite filter
 ed cell complex will be given. Having this knowledge we will consider the 
 problem of rigorous computations of level sets (up to homotopy type) and p
 ersistent homology of sufficiently smooth functions f : Rn ---> Rn.
LOCATION:MA30
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR