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:69f252075db1e
DTSTART;TZID=America/Toronto:20250710T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250710T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-karen-yeats-2
SUMMARY:Algebraic and enumerative combinatorics seminar-Karen Yeats
CLASS:PUBLIC
DESCRIPTION:TITLE:Sizes of witnesses in covtree\n\nSpeaker\n Karen Yeats\n\
 nAffiliation\n University of Waterloo\n\nLocation\n MC 5479\n\nABSTRACT: 
 Here is a purely combinatorial problem that arose in causal\nset theory. 
  Let {P_1\, ... \, P_k} be distinct unlabelled posets all\nwith n elements
 .  Suppose there is a poset Q such that {P_1\, ... \,\nP_k} is exactly th
 e set of downsets of Q of size n up to isomorphism.\nGiven n and k can we 
 give a tight upper bound on the minimum size of\nsuch a Q? As with newspap
 er headlines\, the answer to the question is\nno\, at least for the moment
 \, but I'll explain what we do know.  Joint\nwork with Jette Gutzeit\, Ki
 mia Shaban\, and Stav Zalel.\n\nTHERE WILL BE A PRE-SEMINAR PRESENTING REL
 EVANT BACKGROUND AT THE\nBEGINNING GRADUATE LEVEL STARTING AT 1:30PM\,
DTSTAMP:20260429T184631Z
END:VEVENT
END:VCALENDAR