Arithmetic Progressions of Length Three in Subsets of a Random Set
نویسندگان
چکیده
For integers 1 ≤ M ≤ n, let R(n,M) denote the uniform probability space which consists of all the M -element subsets of [n] = {0, 1, . . . , n − 1}. It is shown that for every α > 0 there exists a constant C such that if M = M(n) ≥ C √ n then, with probability tending to 1 as n → ∞, the random set R ∈ R(n,M) has the property that any subset of R with at least α|R| elements contains a 3-term arithmetic progression. In particular, this result implies that for every α > 0 there exist ‘sparse’ sets S ⊆ [n] with the property that every subset of S with at least α|S| elements contains an arithmetic progression of length three. 1991 Mathematics subject classifications: 11B25, 05D99, 11B05, 11K99
منابع مشابه
ON DISTRIBUTION OF THREE-TERM ARITHMETIC PROGRESSIONS IN SPARSE SUBSETS OF Fp
We prove a version of Szemerédi’s regularity lemma for subsets of a typical random set in F p . As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.
متن کاملMaximal Arithmetic Progressions in Random Subsets
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 −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 ...
متن کاملOn the maximal length of arithmetic progressions∗
This paper is a continuation of Benjamini, Yadin and Zeitouni’s paper [4] on maximal arithmetic progressions in random subsets. In this paper the asymptotic distributions of the maximal arithmetic progressions and arithmetic progressions modulo n relative to an independent Bernoulli sequence with parameter p are given. The errors are estimated by using the Chen-Stein method. Then the almost sur...
متن کاملOn the Distribution of Three-Term Arithmetic Progressions in Sparse Subsets of Fpn
We give a short proof for the following result on the distribution of three-term arithmetic progressions in sparse subsets of Fp : for every α > 0 there exists a constant C = C(α) such that the following holds for all r ≥ Cp and for almost all sets R of size r of Fp . Let A be any subset of R of size at least αr, then A contains a non-trivial three-term arithmetic progression. This is an analog...
متن کاملForbidden arithmetic progressions in permutations of subsets of the integers
Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996