On the number of three-term arithmetic progressions in a dense subset of FqnF_q^n

preprint2016arXivOpen access

Abstract

Let qq be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset A⊂FqnA\subset{\mathbb F}_q^n will contain many non-trivial three-term arithmetic progressions, whenever ∣A∣≥(cqq)n|A|\geq (c_q q)^n for some constant cq>0c_q>0. After the first version of our manuscript was uploaded in the arXiv, we learned from Professors Jacob Fox and Terence Tao that our result is a special case of a result of Fox and Lovasz [1, Theorem 3]. In fact, [1, Theorem 3] gives a much better bound than ours. For example, when q=3q=3, the lower bound given by Fox and Lovasz is ∣A∣2⋅(∣A∣q−n)11.901|A|^{2}\cdot (|A|q^{-n})^{11.901}, while our bound is ∣A∣2⋅(∣A∣q−n)25.803|A|^{2}\cdot (|A|q^{-n})^{25.803}. We thank Professors Jacob Fox and Terence Tao for their helpful comments on our manuscript. [1] Jacob Fox, László Miklós Lovász, A tight bound for Green's arithmetic triangle removal lemma in vector spaces, preprint, arXiv:1606.01230.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.