BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1267
DTSTAMP:20230914T125957Z
SUMMARY:A constant lower bound for the union-closed sets conjecture
DESCRIPTION:Speaker: Dr. Justin Gilmer (Google Brain)\n\nAbstract: \nI will
  introduce Frankl's. conjecture\, discuss prior approaches and why it is a
  bit notorious. Then will discuss an information-theoretic approach that e
 stablishes a constant lower bound for the maximum element frequency in uni
 on-closed families of sets.\n
URL:https://www.tcs.tifr.res.in/web/events/1267
DTSTART;TZID=Asia/Kolkata:20230124T093000
DTEND;TZID=Asia/Kolkata:20230124T103000
LOCATION:via Zoom in A201
END:VEVENT
END:VCALENDAR