On the Structure of Sets with Few Three-Term Arithmetic Progressions

Details On the Structure of Sets with Few Three-Term Arithmetic Progressions On the Structure of Sets with Few Three-Term Arithmetic Progressions

2006-07-07

arxiv.org/abs/math/0607208v1

Mathematics

Number Theory

This is a much cleaner version of a proof published on the arxives three years ago, but where this one holds for finite fields

Scientific paper

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least dp^n. We show that S must have some structure, and that up to o(p^n) elements, it is a union of a small number of cosets of a subspace of dimension n-o(n).

Affiliated with

Also associated with

No associations

Rating

On the Structure of Sets with Few Three-Term Arithmetic Progressions 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 On the Structure of Sets with Few Three-Term Arithmetic Progressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Structure of Sets with Few Three-Term Arithmetic Progressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97499