BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20260329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20261025T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20261014T085855Z
UID:69a7ee41f27e0806927286@ist.ac.at
DTSTART:20261022T131500
DTEND:20261022T153000
DESCRIPTION:Speaker: Andras Juhasz\nhosted by Tamas Hausel\nAbstract: Links
  are disjoint unions of circles smoothly embedded in the 3-sphere. I will 
 explain how we used reinforcement learning and Bayesian optimisation to ob
 tain new upper bounds on several link invariants that are not known to be 
 algorithmically computable: the slice genus and the unknotting number for 
 links\, and the strong slice genus for algebraically split links. I will a
 lso discuss lower bounds using known invariants. Combining the upper and l
 ower bounds\, we obtain new exact values in many cases. Our unknotting age
 nts can reproduce the non-additivity of the unknotting number for several 
 counterexamples due to Brittenham and Hermiller\, in some cases finding ne
 w unknotting trajectories. This is joint work with Yutong Dai\, Oliver Hay
 man\, and Ludovico Morellato.
LOCATION:Office Bldg West / Ground floor / Heinzel Seminar Room (I21.EG.101
 )\, ISTA
ORGANIZER:boosthui@ist.ac.at
SUMMARY:Andras Juhasz: Computations of the slice genus and the unknotting n
 umber of links via machine learning
URL:https://talks-calendar.ista.ac.at/events/6695
END:VEVENT
END:VCALENDAR