Title: On CSPs, Inverse Theorems and Friends

Abstract:
Constraint satisfaction problems (CSPs in short) are among the most important computational problems studied in Theoretical Computer Science.
In this talk we will discuss a recent line of study addressing the complexity of approximating satisfiable instances of CSPs.
We will focus on connections to analytic inverse-type theorems for correlations that generalize the U2-Gowers norm, and show how these results
can be used in other areas, such as property testing and extremal combinatorics.

Based mostly on joint works with Amey Bhangale, Subhash Khot and Yang P. Liu.