New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries

Details New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries

2005-09-23

arxiv.org/abs/math/0509560v3

Mathematics

Combinatorics

30 pages, some irritating small errors corrected

Scientific paper

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0 and some c_F > 0, then A contains four distinct elements in arithmetic progression. This is equivalent, in the usual notation of additive combinatorics, to the assertion that r_4(G) <<_F N(log N)^{-c}.

Affiliated with

Also associated with

No associations

Rating

New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries 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 New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-71332