BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d158d913b65
DTSTART;TZID=America/Toronto:20230921T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230921T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-jeremy
SUMMARY:Algebraic and Enumerative Combinatorics Seminar - Jeremy Chizewer
CLASS:PUBLIC
DESCRIPTION:TITLE: The Sunflower Problem: Restricted Intersections\n\nSPEAK
 ER:\n Jeremy Chizewer\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION
 :\n MC 6029\n\nThere will be a pre-seminar presenting relevant background 
 at the\nbeginning graduate level starting at 1pm.\n\nABSTRACT: A sunflower
  with $r$ petals is a collection of $r$ sets over\na ground set $X$ such t
 hat every element in $X$ is in no set\, every\nset\, or exactly one set. E
 rdos and Rado showed that a family of sets\nof size $n$ contains a sunflo
 wer if there are more than $n!(r-1)^n$\nsets in the family. Alweiss et al.
  and subsequently Rao and Bell et\nal. improved this bound to $(O(r \\log(
 n))^n$.\n\nIn this talk\, I will discuss the sunflower problem with an add
 itional\nrestriction\, a bound on the size of pairwise intersections in th
 e set\nfamily. In particular\, I will show an improved bound for set famil
 ies\nwhen the size of the pairwise intersections of any two sets is in a\n
 set $L$. This talk is based on https://arxiv.org/abs/2307.01374.
DTSTAMP:20260404T183049Z
END:VEVENT
END:VCALENDAR