The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit

Details The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit

2004-12-31

arxiv.org/abs/math/0501004v3

Mathematics

Combinatorics

This draft is a significantly shorter proof of the theorem. To appear in Canadian Math Bulletin

Scientific paper

Given a density t in (0,1], and a prime p, let S be any subset of F_p having at least tp elements, and having the least number of three-term arithmetic progressions mod p among all subsets of F_p with at least tp elements. Define N(t,p) to be 1/p^2 times the number of three-term arithmetic progressions in S modulo p. Note that N(t,p) does not depend on S -- it only depends on t and p. An old result of Varnavides shows that for fixed t, N(t,p) > c(t) > 0 for all primes p sufficiently large. But, does N(t,p) converge to a limit as p -> infinity? We prove that it does.

Affiliated with

Also associated with

No associations

Rating

The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit 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 The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514160