On the Structure of Sets with Few Three-Term Arithmetic Progressions
Ernie Croot
Abstract
Fix a density d in (0,1], and let Fpn be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of Fpn having the minimal number of three-term progressions, subject to the constraint |S| is at least dpn. We show that S must have some structure, and that up to o(pn) elements, it is a union of a small number of cosets of a subspace of dimension n-o(n).
Create a lesson
Related papers
13 unknowns over quadratic integer rings and Lucas congruences
Geng-Rui Zhang
Complete characterization of a class of complete permutation quadrinomials over \(Fq2\)
Yanjun Li, Maosheng Xiong
Sets whose differences avoid a bracket quadratic
Khalid Younis
Matrix representations and arithmetic properties of jacobsthal numbers via binary 3x3 matrices
Wilson Arley Martinez, Samin Ingrith Ceron
Lower Bounds for Moments of L-functions
Sanoli Gun, Gaurav Kumar, Deep Thakur
D(N)-quadruples in upper-triangular 2×2 integer matrices
Andrej Dujella, Zrinka Franušić