Maximal Arithmetic Progressions in Random Subsets

Details Maximal Arithmetic Progressions in Random Subsets Maximal Arithmetic Progressions in Random Subsets

2007-07-26

arxiv.org/abs/0707.3888v1

Mathematics

Probability

Scientific paper

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric) distribution. The same result holds for the maximal length W(N) of arithmetic progressions (mod N). When considered in the natural way on a common probability space, we observe that U(N)/log(N) converges almost surely to 2/log(2), while W(N)/log(N) does not converge almost surely (and in particular, limsup W(N)/log(N) is at least 3/log(2)).

Affiliated with

Also associated with

No associations

Rating

Maximal Arithmetic Progressions in Random Subsets 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 Maximal Arithmetic Progressions in Random Subsets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal Arithmetic Progressions in Random Subsets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40629