Generalizations of Fourier analysis, and how to apply them
From MaRDI portal
Publication:3178746
DOI10.1090/BULL/1550zbMATH Open1360.05019arXiv1608.04127OpenAlexW2963525781MaRDI QIDQ3178746FDOQ3178746
Authors: W. Timothy Gowers 
Publication date: 20 December 2016
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1608.04127
Recommendations
Enumerative combinatorics (05A99) Arithmetic progressions (11B25) Harmonic analysis in one variable (42A99) Primes in congruence classes (11N13)
Cites Work
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Title not available (Why is that?)
- Quasi-random graphs
- A new proof of Szemerédi's theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- On triples in arithmetic progression
- Nonconventional ergodic averages and nilmanifolds
- On sets of integers containing k elements in arithmetic progression
- The primes contain arbitrarily long arithmetic progressions
- On Certain Sets of Integers
- Quasirandom Groups
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- Linear equations in primes
- A variant of the hypergraph removal lemma
- Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- A new proof of the graph removal lemma
- On Roth's theorem on progressions
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
- Integer sets containing no arithmetic progressions
- On certain other sets of integers
- Title not available (Why is that?)
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Parallelepipeds, nilpotent groups and Gowers norms
- Integer Sets Containing No Arithmetic Progressions
- AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
- Roth's theorem on progressions revisited
- Finite field models in additive combinatorics
- A statistical theorem of set addition
- On \(\varepsilon\)-representations
- Jacobi fields and Finsler metrics on compact Lie groups with an application to differentiable pinching problems
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Generalized arithmetical progressions and sumsets
- A Note on a Question of Erdős and Graham
- Yet another proof of Szemerédi's theorem
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Linear forms and quadratic uniformity for functions on \(\mathbb F^n_p\)
- Group actions and curvature
- Notes on compact nilspaces
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- Finite field models in arithmetic combinatorics -- ten years on
- The structure theory of nilspaces. I
- Inverse and stability theorems for approximate representations of finite groups
- Approximate representations, approximate homomorphisms, and low-dimensional embeddings of groups
- Recurrence and non-uniformity of bracket polynomials
Cited In (11)
- Notes on compact nilspaces
- Notes on nilspaces: algebraic aspects
- A short glimpse of the giant footprint of Fourier analysis and recent multilinear advances
- Mellin transform and integro-differential equations with logarithmic singularity in the kernel
- Constant-sized robust self-tests for states and measurements of unbounded dimension
- Fourier analysis in combinatorial number theory
- Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds
- On uncommon systems of equations
- Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits
- Popular progression differences in vector spaces II
- Title not available (Why is that?)
This page was built for publication: Generalizations of Fourier analysis, and how to apply them
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178746)
