A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions

Details A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions

2003-05-22

arxiv.org/abs/math/0305318v1

Mathematics

Number Theory

Scientific paper

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having density at least s, and having the least number of 3-term arithemtic progressions among all sets of density at least s, then S is nearly translation invariant in a very strong sense. Namely, there exists 0 <= b <= q-1 such that |S intersect (S + bj)| = (1-g(s))|S|, for every 0 < j < q^d, where g(s) -> 0 as s -> 0. A curious feature of the proof is that Behrend's construction on large subsets of {1,2,...,x} containing no 3-term a.p., is a key ingredient.

Affiliated with

Also associated with

No associations

Rating

A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-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 A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133564