Talk information

Date: Sunday, June 7, 2026
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Dor Minzer (MIT)
Title: 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 be relevant in many different settings. In this talk, we will discuss preliminary results in this direction, their relevance in different areas and some applications. In particular, we will discuss new bounds for the density Hales-Jewett theorem for length 3 patterns.

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