arXiv Analytics

Sign in

arXiv:math/0607209 [math.NT]AbstractReferencesReviewsResources

On the Decay of the Fourier Transform and Three Term Arithmetic Progressions

Ernie Croot

Published 2006-07-07, updated 2006-09-15Version 4

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too ``small'', then there are lots of triples m,m+d,m+2d such that f(m)f(m+d)f(m+2d) > 0. If f is the indicator function for some set S, then this would be saying that the set has many three-term arithmetic progressions. In principle this theorem can be applied to sets having very low density, where |S| is around p^{n(1-c)} for some small c > 0.

Comments: One small notational correction: In the paper I called ||f||_(1/3) a `norm', when in fact it should be 'quasinorm'. This does not affect any results, as I don't use the triangle inequality anywhere -- the 1/3 quasinorm was only used as a convenient way to state a corollary of one of my results
Categories: math.NT, math.CO
Subjects: 11P70
Related articles: Most relevant | Search more
arXiv:math/0607208 [math.NT] (Published 2006-07-07)
On the Structure of Sets with Few Three-Term Arithmetic Progressions
arXiv:1403.7040 [math.NT] (Published 2014-03-27, updated 2014-05-16)
On systems of complexity one in the primes
arXiv:0709.4432 [math.NT] (Published 2007-09-27)
On the maximal number of three-term arithmetic progressions in subsets of Z/pZ