Firdavs Rakhmonov: Lp averages of the discrete Fourier transform, Salem sets, and applications
Time: Tue 2026-11-24 14.00 - 15.00
Location: Institut Mittag-Leffler
Video link: https://kva-se.zoom.us/j/6583854087
Participating: Firdavs Rakhmonov, University of St Andrews
Abstract: Discrete Fourier analysis has proved to be an effective tool in additive combinatorics. Sets whose Fourier transforms satisfy strong uniform \(L^\infty\) bounds tend to behave more like random sets and are therefore easier to analyze. However, such bounds are often unavailable, even when strong pointwise bounds hold at many frequencies.
A recently proposed approach addresses this limitation by bounding \(L^p\) averages of the Fourier transform. It has been used to study orthogonal projections, distance sets, and sumsets, and to improve existing results on Fourier restriction.
In this talk, I will describe the main idea behind this approach and highlight some recent applications. The talk is based on a series of joint papers with Jon Fraser.
