Article thumbnail

On the Structure of Sets with Few Three-Term Arithmetic Progressions

By Ernie Croot

Abstract

Fix a prime p � 3, and a real number 0 < α � 1. Let S ⊂ Fn p be any set with the least number of solutions to x + y = 2z (note that this means that x,z,y is an arithmetic progression), subject to the constraint that |S | � αpn. What can one say about the structure of such sets S? In this paper we show that they are “essentially” the union of a small number of cosets of some large-dimensional subspace of Fn p.

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.173.3342
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.combinatorics.org/V... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.