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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7daf40e56
DTSTART;TZID=America/Toronto:20241121T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241121T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-torin
SUMMARY:Algebraic and enumerative combinatorics seminar-Torin Greenwood
CLASS:PUBLIC
DESCRIPTION:TITLE:Coloring the integers while avoiding monochromatic arithm
 etic \n\nprogressions\n\nSpeaker\n Torin Greenwood\n\nAffiliation\n North 
 Dakota State University \n\nLocation\n MC 5479\n\n ABSTRACT: Consider col
 oring the positive integers either red or blue\none at a time in order.  
 Van der Waerden's classical theorem states\nthat no matter how you color t
 he integers\, you will eventually have k\nequally spaced integers all colo
 red the same for any k.  But\, how can\nwe minimize the number of times k
  equally spaced integers are colored\nthe same?  Even for k = 3\, this qu
 estion is unsolved.  We will\ndiscuss progress towards proving an existin
 g conjecture by leveraging\na connection to coloring the continuous interv
 al [0\,1]. Our strategy\nrelies on identifying classes of colorings with p
 ermutations and then\nusing mixed integer linear programming.  Joint work
  with Jonathan\nKariv and Noah Williams.\n\nTHERE WILL BE A PRE-SEMINAR PR
 ESENTING RELEVANT BACKGROUND AT THE\nBEGINNING GRADUATE LEVEL STARTING AT 
 1PM\,
DTSTAMP:20260403T084327Z
END:VEVENT
END:VCALENDAR