BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20120529T171500
DTEND;VALUE=DATE:20120529T171500
UID:5652@agenda.unifr.ch
DESCRIPTION:Many theorems start by taking an existence theorem and asking "How \nmany?" or "How big?" or "How fast". The best-known example may be the \nprime number theorem. Euclid proved that infinitely many primes exist, \nand the prime number theorem describes how quickly they grow.\nI'll discuss what happens when you apply the same idea to simple \nconnectivity. In a simply-connected space, any closed curve is the \nboundary of some disc, but how big is that disc? And what can that tell \nyou about the geometry of the space?
SUMMARY:Robert Young (Toronto): Quantifying simple connectivity: an introduction to the Dehn function
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, Phys 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/5652
END:VEVENT
END:VCALENDAR