On inverse theorems, constraint satisfaction problems and combinatorial lines

Abstract: 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

analysis of PDEsclassical analysis and ODEsfunctional analysis

Audience: researchers in the topic

OARS Online Analysis Research Seminar

Series comments: Visit our homepage for further information. Some recordings available on YouTube