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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf79c87e734
DTSTART;TZID=America/Toronto:20250410T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250410T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-natasha-ter
SUMMARY:Algebraic and enumerative combinatorics seminar-Natasha Ter-Saakov
CLASS:PUBLIC
DESCRIPTION:TITLE: Log-concavity of random Radon partitions\n\nSpeaker\n Na
 tasha Ter-Saakov\n\nAffiliation\n Rutgers\n\nLocation\n MC 5479\n\n ABSTR
 ACT: Over one hundred years ago\, Radon proved that any set of\nd+2 points
  in R^d can be partitioned into two sets whose convex hulls\nintersect. I 
 will talk about Radon partitions when the points are\nselected randomly. I
 n particular\, if the points are independent normal\nrandom vectors\, let 
 p_k be the probability that the Radon partition\nhas size (k\, d+2-k). Ans
 wering a conjecture of Kalai and White\, we\nshow that the sequence (p_k) 
 is ultra log-concave and that\, in fact\, a\nbalanced partition is the mos
 t likely. Joint work with Swee Hong Chan\,\nGil Kalai\, Bhargav Narayanan\
 , and Moshe White.\n\nTHERE WILL BE A PRE-SEMINAR PRESENTING RELEVANT BACK
 GROUND AT THE\nBEGINNING GRADUATE LEVEL STARTING AT 1PM\,
DTSTAMP:20260403T082648Z
END:VEVENT
END:VCALENDAR