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:6870ebaea8735
DTSTART;TZID=America/Toronto:20250605T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250605T143000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-arkaprava-choudhury
SUMMARY:C&O Reading Group -Arkaprava Choudhury
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Refuting semirandom CSPs via spectral graph
  theory techniques\n\nSPEAKER:\n Arkaprava Choudhury\n\nAFFILIATION:\n Uni
 versity of À¶Ý®ÊÓƵ\n\nLOCATION:\n MC 6029\n\nABSTRACT:\n\n: In this talk\
 , we will consider recent spectral techniques\, developed\nby [HKM23] and 
 [GKM22]\, for combinatorial and algorithmic problems. We\nshall focus\, in
  particular\, on designing algorithms for refuting\nsemirandom instances o
 f constraint satisfaction problems. The main\ncomponent of the talk is a r
 eduction to studying spectral properties\nof so-called \"Kikuchi graphs\" 
 corresponding to a system of homogeneous\ndegree-q multilinear polynomials
 .\n\nNo prerequisites in spectral graph theory beyond basic linear algebra
 \nare assumed.\n\n[HKM23]: A simple and sharper proof of the hypergraph M
 oore bound\n\n[GKM22]: Algorithms and Certificates for Boolean CSP Refutat
 ion:\n\"Smoothed is no harder than Random\"\n 
DTSTAMP:20250711T104710Z
END:VEVENT
END:VCALENDAR