Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$L^p$ averages of the Fourier transform in finite fields (2407.08589v3)

Published 11 Jul 2024 in math.CO and math.CA

Abstract: The Fourier transform plays a central role in many geometric and combinatorial problems cast in vector spaces over finite fields. If a set admits optimal $L\infty$ bounds on its Fourier transform (that is, it is a Salem set), then it can often be analysed more easily. However, in many cases obtaining good \emph{uniform} bounds is not possible, even if `most' points admit good pointwise bounds. Motivated by this, we propose a framework where one systematically studies the $Lp$ averages of the Fourier transform and keeps track of how good the $Lp$ bounds are as a function of $p$. This captures more nuanced information about a set than, for example, asking whether it is Salem or not. We explore this idea by considering several examples and find that a rich theory emerges. Further, we provide various applications of this approach; including to sumset type problems, the finite fields distance conjecture, and the problem of counting $k$-simplices inside a given set. Our typical application is of the form: if a set admits good $Lp$ bounds on its Fourier transform, then we are able to make strong geometric conclusions.

Summary

We haven't generated a summary for this paper yet.