BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:8177@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20150202T140000
DTEND;TZID=Europe/Paris:20150202T150000
DTSTAMP:20241120T210056Z
URL:https://www.i2m.univ-amu.fr/evenements/the-unlinking-number-of-links/
SUMMARY:Stefan Friedl (...): The unlinking number of links
DESCRIPTION:Stefan Friedl: The unlinking number of a link\, i.e. of a disjo
 int collection of closed curves in S3\, is defined as the minimal number o
 f crossing changes required to turn the link into the trivial link. Determ
 ining the unlinking number of a given link is usually a hard problem. In p
 articular there is no known algorithm for computing the unlinking number. 
 We will present several techniques and results for finding lower bounds on
  the unlinking number. This is joint work with Maciej Borodzik\, Jae Choon
  Cha and Mark Powell.\n\n
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Stefan_Friedl.jpg
CATEGORIES:Séminaire,Dynamique et Topologie
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20141026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR