Subsets of F_p^n without three term arithmetic progressions have several large Fourier coefficients

Details Subsets of F_p^n without three term arithmetic progressions have several large Fourier coefficients Subsets of F_p^n without three term arithmetic progressions have several large Fourier coefficients

2007-07-10

arxiv.org/abs/0707.1496v1

Mathematics

Combinatorics

This is a preliminary draft. Later drafts will have more references and cleaner proofs

Scientific paper

Suppose that f : F_p^n -> [0,1] has expected value t in [p^(-n/9),1] (so, the density t can be quite low!). Furthermore, suppose that support(f) has no three-term arithmetic progressions. Then, we develop non-trivial lower bounds for f_j, which is the jth largest Fourier coefficient of f. This result is similar in spirit to that appearing in an earlier paper [1] by the author; however, in that paper the focus was on the ``small'' Fourier coefficients, whereas here the focus is on the ``large'' Fourier coefficients. Furthermore, the proof in the present paper requires much more sophisticated arguments than those of that other paper.

Affiliated with

Also associated with

No associations

Rating

Subsets of F_p^n without three term arithmetic progressions have several large Fourier coefficients does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Subsets of F_p^n without three term arithmetic progressions have several large Fourier coefficients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subsets of F_p^n without three term arithmetic progressions have several large Fourier coefficients will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453962