BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20230326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260425T051651Z
UID:1698068700@ist.ac.at
DTSTART:20231023T154500
DTEND:20231023T164500
DESCRIPTION:Speaker: William Da Silva\nhosted by M. Beiglböck\, N. Beresty
 cki\, L. Erdös\, J. Maas\, F. Toninelli\, E. Schertzer\nAbstract: The Bro
 wnian separable permutons are a family of universal limits of random const
 rained permutations\, depending on some parameter p in (0\,1). We prove ex
 plicit polynomial bounds for the length of the longest increasing subseque
 nce in the Brownian separable permutons\, and present simulations suggesti
 ng that the lower bound is close to optimal for all p. The strategy relies
  on a connection to fragmentation processes that I will highlight in the t
 alk. The talk is based on joint work with Jacopo Borga (Stanford Universit
 y) and Ewain Gwynne (University of Chicago). 
LOCATION:Mondi 2 (I01.01.008)\, Central Building\, ISTA
ORGANIZER:birgit.oosthuizen-noczil@ist.ac.at 
SUMMARY:William Da Silva: The length of the longest increasing subsequence 
 in the Brownian separable permutons
URL:https://talks-calendar.ista.ac.at/events/4338
END:VEVENT
END:VCALENDAR