The distribution of polynomials over finite fields, with applications to the Gowers norms

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if P is determined by the values of a few polynomials of lower degree, in which case we say that P has small rank. We give several applications of this result, paying particular attention to consequences for the theory of the so-called Gowers norms. We establish an inverse result for the Gowers U^{d+1}-norm of functions of the form f(x)= e_F(P(x)), where P : F^n -> F is a polynomial of degree less than F, showing that this norm can only be large if f correlates with e_F(Q(x)) for some polynomial Q : F^n -> F of degree at most d. The requirement deg(P) < |F| cannot be dropped entirely. Indeed, we show the above claim fails in characteristic 2 when d = 3 and deg(P)=4, showing that the quartic symmetric polynomial S_4 in F_2^n has large Gowers U^4-norm but does not correlate strongly with any cubic polynomial. This shows that the theory of Gowers norms in low characteristic is not as simple as previously supposed. This counterexample has also been discovered independently by Lovett, Meshulam, and Samorodnitsky. We conclude with sundry other applications of our main result, including a recurrence result and a certain type of nullstellensatz.

[1]  Shachar Lovett,et al.  Inverse conjecture for the gowers norm is false , 2007, Theory Comput..

[2]  Emanuele Viola,et al.  Pseudorandom Bits for Polynomials , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[3]  W. T. Gowers,et al.  A new proof of Szemerédi's theorem , 2001 .

[4]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[5]  J. Spencer Ramsey Theory , 1990 .

[6]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[7]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[8]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[9]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[10]  Ben Green,et al.  AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM , 2008, Proceedings of the Edinburgh Mathematical Society.

[11]  Ben Green,et al.  Linear equations in primes , 2006, math/0606088.

[12]  Terence Tao,et al.  Structure and Randomness in Combinatorics , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  T. Tao,et al.  The primes contain arbitrarily long arithmetic progressions , 2004, math/0404188.

[14]  W. T. Gowers,et al.  A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .

[15]  Noga Alon,et al.  Lower bounds for approximations by low degree polynomials over Z/sub m/ , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[16]  Oleg Golberg Combinatorial Nullstellensatz , 2007 .

[17]  Alex Samorodnitsky,et al.  Low-degree tests at large distances , 2006, STOC '07.

[18]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[19]  Ben Green,et al.  New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries , 2009 .