On the Decay of the Fourier Transform and Three Term Arithmetic Progressions
نویسنده
چکیده
In this paper we prove a basic theorem which says that if f : Fpn → [0, 1] has few ‘large’ Fourier coefficients, and if the sum of the norms squared of the ‘small’ Fourier coefficients is ‘small’ (i.e. the L2 mass of f̂ is not concetrated on small Fourier coefficients), then Σn,df(n)f(n+ d)f(n + 2d) is ‘large’. If f is the indicator function for some set S, then this would be saying that the set has many three-term arithmetic progressions. In principle this theorem can be applied to sets having very low density, where |S| is around pn(1−γ) for some small γ > 0. We conjecture that the condition that the sum of norms squared of small Fourier coefficients should not be necessary to obtain this conclusion; and, if this can be proved, it would mean that any subset of Fpn deficient in three-term progressions, must have quite of lot of large Fourier coefficients, even when the set has very low density.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملArithmetic progressions in sets of fractional dimension
Let E ⊂ R be a closed set of Hausdorff dimension α. We prove that if α is sufficiently close to 1, and if E supports a probability measure obeying appropriate dimensionality and Fourier decay conditions, then E contains non-trivial 3-term arithmetic progressions. Mathematics Subject Classification: 28A78, 42A32, 42A38, 42A45, 11B25.
متن کاملSubsets of Fpn without three term arithmetic progressions have several large Fourier coefficients
Suppose that f : Fpn → [0, 1] satisfies Σaf(m) = θF ∈ [F , F ], where F = |Fpn | = p. In this paper we will show the following: Let fj denote the size of the jth largest Fourier coefficient of f . If fj < θ j1/2+δF, for some integer j satisfying J0(δ, p) < j < F , then S = support(f) contains a non-trivial three-term arithmetic progression. Thus, the result is asserting that if the Fourier tran...
متن کاملAn Introduction to Additive Combinatorics
This is a slightly expanded write-up of my three lectures at the Additive Combinatorics school. In the first lecture we introduce some of the basic material in Additive Combinatorics, and in the next two lectures we prove two of the key background results, the Freiman-Ruzsa theorem and Roth’s theorem for 3-term arithmetic progressions. Lecture I: Introductory material 1. Basic Definitions. 2. I...
متن کاملA Probabilistic Technique for Finding Almost-periods of Convolutions
We introduce a new probabilistic technique for finding ‘almost-periods’ of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need for a nice Fourier transform to exist. We also present applications, some of which are new even in the abelian setting. These include a probabilistic proof ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007