Abstract
Let be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset will contain many non-trivial three-term arithmetic progressions, whenever for some constant . 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 , the lower bound given by Fox and Lovasz is , while our bound is . 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.