Generalizations of Fourier analysis, and how to apply them
arXiv:1608.04127
Abstract
This is a survey of the use of Fourier analysis in additive combinatorics, with a particular focus on situations where it cannot be straightforwardly applied, but needs to be generalized first. Sometimes very satisfactory generalizations exist, while sometimes we have to make do with theories that have some of the desirable properties of Fourier analysis but not all of them. In the latter case, there are intriguing hints that there may be more satisfactory theories yet to be discovered. This article grew out of the Colloquium Lectures at the Joint Meeting of the AMS and the MAA, given in Seattle in January 2016.
arXiv comment57 pages
References in corpus (7)
- Progression-free sets in Z_4^n are exponentially small
- Nilspaces, nilmanifolds and their morphisms
- On higher order Fourier analysis
- Structure of finite nilspaces and inverse theorems for the Gowers norms in bounded exponent groups
- Notes on nilspaces: algebraic aspects
- Notes on compact nilspaces
- Recurrence and non-uniformity of bracket polynomials