BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240311T121500
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:ec71537fb9a8afa0218a240230cc49dd
CATEGORIES:Graduate Student Combinatorics Seminar Sponsored by DIMACS
CREATED:20250310T101055
SUMMARY:Covering the hypercube with hyperplanes
LOCATION:HLL-701
DESCRIPTION:
CONTACT:Caleb Fong
X-EXTRAINFO:Abstract:\nThe n-dimensional Boolean hypercube Q_n can be easily covered wi
 th 2 hyperplanes. If you add the additional restriction that exactly one po
 int must remain uncovered, it takes some work to show—as Alon and Furedi di
 d in 1993—that you need at least n hyperplanes to cover the rest. We will s
 ee the quick Combinatorial Nullstellensatz proof of this result, along with
  some more recent work on k-fold hyperplane covers of the hypercube (minus 
 a point) due to Alexander Clifton and Hao Huang in 2019. 
DTSTAMP:20260827T025759
DTSTART;TZID=America/New_York:20250312T121500
DTEND;TZID=America/New_York:20250312T131500
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR