No CrossRef data available.
Article contents
On the Distribution of Three-Term Arithmetic Progressions in Sparse Subsets of Fpn
Published online by Cambridge University Press: 18 August 2011
Abstract
We give a short proof of the following result on the distribution of three-term arithmetic progressions in sparse subsets of Fpn. For every α > 0 there exists a constant C = C(α) such that the following holds for all r ≥ Cpn/2 and for almost all sets R of size r of Fpn. 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 analogue of a hard theorem by Kohayakawa, Łuczak and Rödl. The proof uses a version of Green's regularity lemma for subsets of a typical random set, which is of interest in its own right.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2011
References
[1]Brown, T. C. and Buhler, J. P. (1984) Lines imply spaces in density Ramsey theory. J. Combin. Theory Ser. A 36 214–220.CrossRefGoogle Scholar
[2]Frankl, P., Graham, R. L. and Rödl, V. (1987) On subsets of abelian groups with no three-term arithmetic progression. J. Combin. Theory Ser. A 45 157–161.CrossRefGoogle Scholar
[3]Green, B. (2005) A Szemerédi-type regularity lemma in Abelian groups, with applications. Geom. Funct. Anal. 15 340–376.CrossRefGoogle Scholar
[4]Kohayakawa, Y., Łuczak, T. and Rödl, V. (1996) Arithmetic progressions of length three in subsets of a random set. Acta Arith. 75 133–163.CrossRefGoogle Scholar
[5]Tao, T. and Vu, V. (2006) Additive Combinatorics, Cambridge University Press.CrossRefGoogle Scholar