The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
Authors:
- 4 March 2010
- journal article
- Published by Mathematical Sciences Publishers in Analysis & PDE
- Vol. 3 (1) , 1-20
Abstract
The inverse conjecture for the Gowers norms $U^d(V)$ for finite-dimensional vector spaces $V$ over a finite field $\F$ asserts, roughly speaking, that a bounded function $f$ has large Gowers norm $\|f\|_{U^d(V)}$ if and only if it correlates with a phase polynomial $\phi = e_\F(P)$ of degree at most $d-1$, thus $P: V \to \F$ is a polynomial of degree at most $d-1$. In this paper, we develop a variant of the Furstenberg correspondence principle which allows us to establish this conjecture in the large characteristic case $\charac(F) \geq d$ from an ergodic theory counterpart, which was recently established by Bergelson and the authors. In low characteristic we obtain a partial result, in which the phase polynomial $\phi$ is allowed to be of some larger degree $C(d)$. The full inverse conjecture remains open in low characteristic; the counterexamples by Lovett-Meshulam-Samorodnitsky or Green-Tao in this setting can be avoided by a slight reformulation of the conjecture.Comment: 21 pages, no figures, to appear, Analysis & PDE. This is the final version, incorporating the referee's correction
Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometriesProceedings of the London Mathematical Society, 2008
- AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORMProceedings of the Edinburgh Mathematical Society, 2008
- Spectral Graph Theory and its Applications2007
- Multiple recurrence and convergence for sequences related to the prime numbersJournal für die reine und angewandte Mathematik (Crelles Journal), 2007
- Testing Reed–Muller CodesIEEE Transactions on Information Theory, 2005
- Nonconventional ergodic averages and nilmanifoldsAnnals of Mathematics, 2005
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and TechniquesLecture Notes in Computer Science, 2003
- A new proof of Szemerédi's theoremGeometric and Functional Analysis, 2001
- A New Proof of Szemer di's Theorem for Arithmetic Progressions of Length FourGeometric and Functional Analysis, 1998
- Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressionsJournal d'Analyse Mathématique, 1977