BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:222266
DTSTAMP:20250820T103612Z
DTSTART;TZID=America/New_York:20250826T160000
DTEND;TZID=America/New_York:20250826T170000
URL;TYPE=URI:https://wpiedudev.wpi.edu/news/calendar/events/department-math
 ematical-sciences-discrete-math-seminar-sam-adriaensen-wpi-and-vrije-unive
 rsiteit
SUMMARY:Department of Mathematical Sciences Discrete Math Seminar: Sam Adri
 aensen, WPI and Vrije Universiteit Brussel
DESCRIPTION:\n\n\n      \n\n\n\n\nDepartment of Mathematical Sciences\nDisc
 rete Math Seminar\nTuesday, August 26th, 2025\nOlin Hall 126, 4:00PM- 4:50
  PM\nSpeaker: Sam Adriaensen, WPI and Vrije Universiteit Brussel\nTitle: H
 at guessing games on graphs\nAbstract: Many games in recreational mathemat
 ics involve a warden playing a sadistic game on a group of smart prisoners
 . In this talk we will analyze one such type of game. Imagine the warden a
 ssigns a hat to each prisoner, and every hat has a color from a pre-determ
 ined set of colors. Each prisoner sees the hats of all other prisoners, bu
 t not themself. Then all prisoners make simultaneous guesses as to which c
 olor of hat they have. If at least one prisoner guesses correctly, the pri
 soners win the game and regain their freedom. The question we ask is:Given
  the number of prisoners, say n, what is the largest number of hat colors,
  say q, such that the prisoners can devise a strategy that guarantees vict
 ory?\nThis question is not too hard to answer. (You might try it yourself,
  or see the answer in the beginning of the talk.) The question becomes mor
 e interesting if we restrict which prisoners can see each other. A graph i
 s the perfect tool to describe this setting. The hat guessing number of a 
 graph G is then defined to be the largest number q of colors for which the
  prisoners can guarantee a winning strategy, when G describes visibility b
 etween prisoners.In this talk, we will discuss some of the known results c
 oncerning hat guessing. I might also discuss some new results obtained dur
 ing a Polymath Jr project co-mentored with Anurag Bishnoi and Jame Tuite.\
 n
END:VEVENT
END:VCALENDAR