Dor Minzer (MIT) - On inverse theorems, constraint satisfaction problems and combinatorial lines скачать в хорошем качестве

Dor Minzer (MIT) - On inverse theorems, constraint satisfaction problems and combinatorial lines

Dor Minzer (Massachusetts Institute of Technology) - On inverse theorems, constraint satisfaction problems and combinatorial lines Recorded talk on Mar 17, 2026 at the Online Analysis Research Seminar (OARS) Suppose f_1, ..., f_k are functions that have a non-negligible correlation over a product distribution \mu^n; what structure can be deduced about the functions f_1, ..., f_k? While our initial motivation to study this problem stems from theoretical computer science, it turns out to appear in many different settings. In this talk, we will discuss some preliminary results and their applications. Based on joint works with Amey Bhangale, Subhash Khot and Yang P. Liu