BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Dor Minzer (Massachusetts Institute of Technology)
DTSTART:20260317T150000Z
DTEND:20260317T160000Z
DTSTAMP:20260423T005656Z
UID:OARS/78
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OARS/78/">On
  inverse theorems\, constraint satisfaction problems and combinatorial lin
 es</a>\nby Dor Minzer (Massachusetts Institute of Technology) as part of O
 ARS Online Analysis Research Seminar\n\n\nAbstract\nSuppose $f_1\, ...\, f
 _k$ are functions that have a non-negligible correlation over a product di
 stribution $\\mu^n$\; what structure can be deduced about the functions $f
 _1\, ...\, f_k$? \nWhile our initial motivation to study this problem stem
 s from theoretical computer science\, it turns out to appear in many diffe
 rent settings. In this talk\, we will discuss some preliminary results and
  their applications. \nBased on joint works with Amey Bhangale\, Subhash K
 hot and Yang P. Liu\n
LOCATION:https://researchseminars.org/talk/OARS/78/
END:VEVENT
END:VCALENDAR