Chowla’s cosine problem
Abstract.
Suppose that is a discrete abelian group and is a finite symmetric set. We show two main results.
-
(i)
Either there is a set of subgroups of with where , or there is a character such that where is the same absolute constant.
-
(ii)
If is finite and then either there is a subgroup such that , or there is a character such that .
1. Introduction
Suppose that is an abelian group, which we shall think of as discrete. We write for the dual group, that is the compact abelian group of homomorphisms and denote the Haar probability measure on by . In general, if is a compact open subset of a locally compact abelian group then denotes Haar measure restricted to and normalized to be a probability measure.
The Fourier transform is the map which takes to determined by
It is useful to use the Fourier transform to define the space of functions endowed with the norm
where the integration is, of course, with respect to the Haar probability measure on . We have the Fourier inversion formula, Plancherel’s theorem and Parseval’s theorem which we use liberally and without further mention; the classic text [Rud90] of Rudin includes all the details.
Now, suppose that is a finite symmetric subset of . Since is symmetric it is easy to see that is real-valued, and it becomes natural to ask how positive or negative it may get. The former question is trivial: a quick calculation reveals that , and since trivially , we see that gets as large as it possibly could. The latter is not so simple: writing
we want a lower bound on in terms of .
In the paper [Cho65], Chowla asked for such a lower bound on . By a simple averaging argument and the Littlewood conjecture (resolved independently by Konyagin [Kon81] and McGehee, Pigno and Smith [MPS81]) one gets that . Prior to the resolution of the Littlewood conjecture some progress had been made for generic by Roth in [Rot73]. However, the logarithmic barrier was first breached by Bourgain in [Bou86], using a method which was later refined by Ruzsa, [Ruz04], to give the following result.
Theorem 1.1 ([Ruz04, Theorem 2]).
Suppose that is a finite, non-empty symmetric set of integers. Then
This theorem is the best known to date; in the other direction there are sets with , but nothing better.
Recently, Green and Konyagin in [GK09] began work extending Littlewood’s conjecture to abelian groups other than . In both Littlewood’s conjecture and Chowla’s problem there is a simple obstacle to the most obvious extension: if is a finite subgroup of then and . It turns out that in a number of cases this is really the only barrier.
In their work Green and Konyagin addressed the discrete analogue of the Littlewood conjecture and their result can be used in the same way as the Littlewood conjecture in to get that if . We are able to do somewhat better – even than the obvious analogue of Theorem 1.1 – and shall show the following.
Theorem 1.2.
Suppose that is a prime and is symmetric and of size . Then
In fact, through careful accounting one can arrange for the constant to be . For comparison Spencer showed in [Spe85] that there are sets of size with and hence . It seems interesting to try to close this gap.
As is turns out we shall prove the following generalization of the above result. To preserve the strength of the bound we impose the additional constraint that has density bounded away from .
Theorem 1.3.
Suppose that is a finite abelian group and is symmetric with . Then there is a subgroup such that
Note that if is prime then the only subgroups of are trivial, whence if we se that and we have Theorem 1.2.
Now, for comparison, if is the union of a (large) finite subgroup and other points, then and , so the result is best possible up to the power. In fact, in many cases this has to be smaller than as noted for above.
The main defect of the above theorem is that is required to have density bounded away from and so it has no bearing on Chowla’s original problem. Our next result recovers the situation although at considerable cost to the bound.
Theorem 1.4.
Suppose that is an abelian group and is a non-empty symmetric set. Then there is a set of subgroups of with such that
where .
Note that we have to allow unions of subgroups. Consider, for example, the case of where and are subgroups with . It is easy to show that .
We close this introduction with an outline of the paper. In §2 we illustrate some trivial arguments for showing when is non-zero; these trivial arguments turn out to be central to our later work. Then, in §§3&
4 we prove Theorem 1.3, through some analysis of the spectrum of boolean functions.
The remainder of the paper is then devoted to proving Theorem 1.4 (which uses Theorem 1.3) in §§5–7. To do this we recall the technology of Bourgain systems from [GS08], although this is entirely contained in §§5&
6 and may be treated as a black box from the perspective of the rest of the paper. Finally, §8 closes with some concluding remarks.
2. A trivial estimate
It is instructive for us to begin by proving a weak version of our main results:
Proposition 2.1.
Suppose that is an abelian group and is a non-empty symmetric set. Then there is a subgroup such that
The method of proof in fact gives somewhat more general results which will be needed later: it applies not just to functions which are boolean, but also those which are almost boolean, and it is stronger for functions which are constant on cosets of a large subgroup.
Suppose that is an abelian group, and . Then is said to be -almost boolean if
In the following the reader may wish to specialize to the case and , where , which gives Proposition 2.1.
Lemma 2.2.
Suppose that is an abelian group with a finite subgroup and is a symmetric -almost boolean function, constant on cosets of , with for some . Then at least one of the following holds:
-
(i)
there is a subgroup such that ;
-
(ii)
or there is a character such that .
Proof.
Let , and note that by definition
so by integrating we get
(2.1) |
since is -almost boolean.
is symmetric, so is symmetric and , so is non-empty. Thus, either is a group, or there are elements such that . Now, is constant on cosets of , so is constant on cosets of , and since cosets of partition we conclude that and .
In view of all this information we evaluate the inner product
On the one hand, by symmetry of , this is
which is at most , from our various assumptions on and . On the other, by Plancherel’s theorem, the inner product is equal to
The integral is well defined because the range of integration is restricted to and so the value of is independent of the coset representative of that is chosen; the inequality follows since maps into , whence which implies that . We conclude that there is some character such that
and we are in the second case by (2.1), after noting that the symmetry of implies that is real-valued. ∎
A very similar argument yields another result which we shall need later, this time for -almost boolean functions. Again, if we specialize to the case and , where we get Proposition 2.1.
Lemma 2.3.
Suppose that is an abelian group with a finite subgroup and is a real symmetric -almost boolean function, constant on cosets of , with for some . Then at least one of the following holds:
-
(i)
the set is a subgroup of ;
-
(ii)
or there is a character such that .
Proof.
We proceed as in the previous lemma. is symmetric, so is symmetric and , so is non-empty. Thus, either is a group, or there are elements such that . Now, is constant on cosets of , so is constant on cosets of , and since cosets of partition we conclude that and .
In view of all this information we evaluate the inner product
On the one hand by symmetry of , this is
which is at most
equals . On the other, by Plancherel’s theorem, the inner product is equal to
The integral is well defined because the range of integration is restricted to and so the value of is independent of the coset representative of that is chosen; the inequality follows since maps into , whence which implies that . We conclude that there is some character such that
after noting that the symmetry of implies that is real-valued. The lemma follows. ∎
3. The spectrum of boolean functions
Suppose that is an abelian group, is a finite subset of and is a parameter. Then the spectrum of is defined to be
We shall be considering both powers and convolution powers and it will be useful to have a notation for the latter. For a function we write for the -fold convolution of with itself, so and .
As first observed by Bourgain in [Bou86], the fact that is boolean gives us considerable information about the spectrum of in the following sense. For any positive integer we have , whence
(3.1) |
This is only useful because in our problem we are able to assume that is small, whence a small amount of information about can be leveraged into much more information.
We use these data in both the lemmas of this section; in the first we show that if is small then we either have considerable structure of the spectrum or there is a character at which the Fourier transform is large but not too large.
Lemma 3.1.
Suppose that is a finite abelian group, is a symmetric set of density and is a parameter. Then at least one of the following is true:
-
(i)
is a subgroup of ;
-
(ii)
we have the estimate (where the in is not to be confused with that in the algebra norm );
-
(iii)
or there is a character such that .
Proof.
is clearly a symmetric neighborhood of , meaning that is a symmetric set containing . Hence it is a group iff for all we have . Thus we are either in the first case of the lemma, or else there are characters with ; suppose we are given such characters.
The instance of equation (3.1), and the fact that in our normalization Haar measure on assigns to each element of the mass , tells us that
Since we conclude that either and we are in the second case of the lemma, or else , and we are in the third case of the lemma with . ∎
The following lemma makes use of (3.1) for larger values of and is really the heart of Theorem 1.3. The basic idea is fairly straightforward and we explain it now in words.
Suppose that is such that is large and that for a contradiction. This positivity gives
The left-hand side can (essentially) be expanded using the Bonferroni inequalities to give
A short manipulation and (3.1) then gives us that
which is a contradiction if is large enough in terms of . We now make this precise.
Lemma 3.2.
Suppose that is a finite abelian group and is symmetric of density . If there is some character with , then
Proof.
It will be useful to write for the function defined by . We claim that for any positive integer we have
(3.2) |
Proof of claim.
Let ; the reasons for this choice of will become apparent later. Since , we have that , which can be expanded using the binomial theorem to give
Now, suppose that . Then by (3.1) and (3.2) we have that
Trivially , and so
It follows that the sum in (3) is at most
Now, since we get that
and so
Finally, equations (3.1) and (3.2) together imply that
and
Define by and combining the above with the fact that we have
Rearranging all this and using the fact that and we get that
Thus, again since , we have
∎
4. Proof of Theorem 1.3
Theorem 1.3 follows immediately from the following more explicit version.
Theorem 4.1.
Suppose that is a finite abelian group, is a symmetric neighborhood of (meaning that is a symmetric set containing ) of size and is a parameter. Then at least one of the following holds:
-
(i)
there is a subgroup such that ;
-
(ii)
there is a character such that .
The work of the previous section combines easily to show that either the large spectrum forms a subgroup or else there is a large negative Fourier coefficient. In the former case is well approximated by . It is then easy by the trivial estimates of §2 that either takes a large negative value or is approximately a subgroup. The details now follow.
Before beginning the proof we require one final technical calculation which is implicit in the paper [Bou02] of Bourgain.
Lemma 4.2.
Suppose that is an abelian group, and . Then
where denotes the standard inner product
Proof.
is a probability measure so , hence for all and for all . Consequently
However, from which the lemma follows. ∎
Proof of Theorem 4.1.
We may certainly suppose that is not a subgroup of , or else we are trivially done with , and so it follows from Proposition 2.1 that . Thus
where the passage from the first to the second line is via the Fourier inversion formula.
For convenience we put ; the reason for this choice of parameter will become clear. If there is a character with , then by Lemma 3.2 we have
and it follows from (4) that we are in the second case of the theorem. We may thus suppose that there is no such character. Apply Lemma 3.1 with parameter . Either is a subgroup of , or
in which case it follows from (4) that we are in the second case of the theorem, or there is a character with
which contradicts our earlier supposition. Thus we may assume that is a subgroup of and , so by nesting of the spectrum
In view of this
By Parseval’s theorem we have
whence
and we conclude that there is some such that .
Similarly, by Plancherel’s theorem we have that
Then, by Lemma 4.2 we have
It follows that is -almost boolean. We now apply Lemma 2.2 to and the group to conclude that either
-
(i)
there is a subgroup such that
-
(ii)
or there is a character such that
In the first instance, by the triangle inequality we have
and we find ourselves in the first case of the theorem.
In the second instance since we see that
(4.2) |
By Parseval’s theorem we have
and it follows that , and hence that . Finally, inserting this bound into (4.2) places us in the second case of the theorem and we are done – in fact in this case we have , however earlier parts of the proof led to the weaker conclusion in the second case. ∎
5. Bourgain systems
In this section we recall the notion of Bourgain system from the paper [GS08]. Although formally new in that paper the material of this section is morally standard c.f. [TV06].
We should remark that in [GS08] all the results are stated for finite abelian groups. There is no change in the passage to finite systems in discrete abelian groups which is the case we shall need; we shall make no further comment on the matter.
Suppose that is an abelian group and is an integer. A Bourgain system of dimension is a collection of finite subsets of such that the following axioms are satisfied:
-
(i)
(Nesting) If we have ;
-
(ii)
(Zero) for all ;
-
(iii)
(Symmetry) If then ;
-
(iv)
(Addition) For all such that we have ;
-
(v)
(Doubling) If then .
We define the size of to be and denote it . Frequently we shall consider several Bourgain systems ; in this case the underlying sets will be denoted . We say that a Bourgain system is a sub-system of if for all .
It may be useful to keep some examples of Bourgain systems in mind: the prototypes are coset progressions first introduced by Green and Ruzsa in [GR07] in their proof of Freĭman’s theorem in general abelian groups.
Example (Coset progressions).
Suppose that is an abelian group, is finite, and . We define the coset progression to be the set
The system is easily seen to be a Bourgain system and since
where and , we see that it is -dimensional.
In a qualitative sense Freĭman’s theorem shows that all Bourgain systems are essentially coset progressions. Indeed, suppose that is an -dimensional Bourgain system then and so by Freĭman’s theorem there is an -dimensional coset progression of size which contains . Quantitatively it is worth being more subtle and dealing with the more abstract Bourgain system.
For more examples and a detailed explanation the reader may wish to consult [GS08].
The following trivial lemma gives us a useful bound for the size of a low-dimensional Bourgain system.
Lemma 5.1 ([GS08, Lemma 4.4]).
Suppose that is an abelian group, is a Bourgain system of dimension and is a parameter. Then is a Bourgain system of dimension and size at least .
Not all Bourgain systems behave as well as we would like; we say that a Bourgain system of dimension is regular if
for all with . Typically, however, Bourgain systems are regular, a fact implicit in the usual proof of the following proposition.
Proposition 5.2 ([GS08, Lemma 4.12]).
Suppose that is an abelian group and is a Bourgain system of dimension . Then there is a such that is regular.
We associate to a system of measures denoted defined by where denotes the uniform probability measure with support . It is more natural to take the measures rather than , however certain positivity requirements in [GS08] precipitated the use of these convolved measures and we shall in fact further leverage this convenience in the proof of Corollary 6.3 below.
Lemma 5.3 ([GS08, Lemma 4.13]).
Suppose that is an abelian group, is a regular Bourgain system of dimension and . Then
where we recall that denotes the measure induced by .
Lemma 5.4 ([GS08, Lemma 4.15]).
Suppose that is an abelian group, is a regular Bourgain system of dimension and . Then
The previous lemma encodes the idea that is in some sense continuous. We shall make use of this by way of a sort of intermediate value theorem; this sort of idea appeared first in [GK09].
Lemma 5.5.
Suppose that is an abelian group, is a regular Bourgain system of dimension and is such that is -almost boolean for some . Then is constant on cosets of , the group generated by .
Proof.
Suppose that so
Now, if then
by Lemma 5.4. Furthermore, is -almost boolean whence there is some such that
Combining these three expressions using the triangle inequality we get that
It follows that so that . Thus and we arrive at the result. ∎
6. Quantitative notions of continuity in
A key tool in the paper [GS08] was a localization of an argument of Green and Konyagin [GK09] to Bourgain systems. Roughly their result gave a quantitative interpretation of the qualitative fact that if then is (essentially) continuous. Specifically we require the following proposition which can be read out of the proof of [GS08, Proposition 5.1].
Proposition 6.1.
Suppose that is an abelian group, is a finite subset of , is a regular Bourgain system of dimension and is a parameter. Then there is a regular sub-system with
and
such that
for every for which is regular, where we recall that is endowed with , the measure induced by .
It should be remarked that it is possible to improve the powers of and in this theorem and doing so results in an improvement to the power of in Theorem 1.4.
We also require the celebrated Balog-Szemerédi and Freĭman theorems of [BS94] and [Fre73]; see [TV06] for a comprehensive discussion. Our use follows the time honored method laid down by Gowers in [Gow98] and the weakness of the powers in Proposition 6.2 is the main reason we have not given an explicit constant for the power of in Theorem 1.4. There is some hope that this may be remedied if the arguments of [GT09] are transfered to the general setting.
The following can be read out of the proof of [GS08, Proposition 6.3].
Proposition 6.2.
Suppose that is an abelian group and is a finite subset of with . Then there is a regular Bourgain system with
such that
The key result of this section is the following which will be the only result that we require again from this or the previous section.
Corollary 6.3.
Suppose that is an abelian group and are non-empty, finite subsets of with and is a parameter. Then there is a subgroup with
such that is -almost boolean and an such that .
Proof.
Apply Proposition 6.2 to the set to get a regular Bourgain system with
such that
Set the parameter and apply Proposition 5.2 to pick a with
(6.1) |
such that is regular.
Now, apply Proposition 6.1 to (not ) with the regular Bourgain system and parameter to get a regular sub-system with
and
such that
(6.2) |
for all such that is regular.
Given this, apply Lemma 5.4 and Proposition 5.2 to get a regular with such that
(6.3) |
Let be the group generated by . Then, by Lemma 5.1 we have that
as desired.
Suppose that there is some such that for all . Then we see that for all by (6.3). However, integrating this contradicts (6.2). It follows that is -almost boolean.
Writing we see from the definition of and Lemma 5.5 that is constant on cosets of . Now
by the Cauchy-Schwarz inequality. Hence
Since is constant on cosets of we have that and hence conclude that is -almost boolean as required (in view of the definition of ).
On the other hand by Lemma 5.3, the upper bound on and the fact that is a sub-system of we get that
It follows that
But, by Parseval’s theorem
since . Combining these with Plancherel’s theorem tells us that
It follows from Hölder’s inequality that there is some for which .
It remains to note that whence . Since is -almost boolean we see that ; it follows that and so . The proof is complete. ∎
7. Proof of Theorem 1.4
Our proof of Theorem 1.4 is iterative in nature with the next lemma being driver. We briefly sketch the statement in words to aid understanding.
We build up a collection of subgroups. At each stage if is small and is not essentially the union of the subsgroups we have already found then we may find another subgroup which is ‘very orthogonal’ to those already found and which is almost entirely contained in .
The orthogonality coupled with the algebra norm bound (resulting from the fact that is small) implies that the iteration cannot proceed for too many steps.
Lemma 7.1.
Suppose that is an abelian group, is a non-empty, finite symmetric subset of and are parameters. Suppose, further, that is a finite collection of subgroups of with
such that
Then, recalling that , at least one of the following is true:
-
(i)
(Good approximation)
-
(ii)
(Large negative Fourier coefficient)
-
(iii)
(Unbalanced parameters)
for some absolute ;
-
(iv)
(Correlating subgroup) there is a subgroup with
such that
Proof.
Begin by considering the function . By the triangle inequality and the fact that , we have
i.e. behaves quite a lot like a boolean function: the indicator function of the set . In particular, is non-negative and if , then , so we have that
Furthermore, since takes values in we have that
(7.1) |
Now, let be the function . It follows from the triangle inequality and the fact that the algebra norm of a subspace is that
By Parseval’s theorem we have that
However, by -convexity of the -norms and Parseval’s theorem
whence
(7.2) |
Write for the set and for the set , so that
Since for all we have , so by the triangle inequality for the -norm and (7.1) we have
Thus, either and we are in case (i), or else
(7.3) |
By the triangle inequality for the -norm we have
(7.4) |
However by Hölder’s inequality, the Hausdorff-Young inequality and Parseval’s theorem we have that
Where the last inequality is from (7.1). Similarly
Inserting these estimates into (7.4) we get that
Now, by Parseval’s theorem we have
Thus either and we are in case (i) or else
Now, apply Corollary 6.3 to with parameter to get a subgroup with
such that is -almost boolean and an such that . We let
and we shall now show that has the necessary properties to be the group in case (iv) of the lemma.
Claim.
is a subgroup.
Proof.
Claim.
Proof.
Since we see that either we are in (iii) or else as required. The upper bound follows since is finite and for all . ∎
Claim.
Proof.
Apply Theorem 1.3 to the set (possible since is finite), so that either there is a subgroup such that
(7.5) |
or else we have a character (on which induces a character on ) such that
It follows that we are in (ii) by averaging since is a probability measure.
Since is -almost boolean (and is a subgroup so ) we have that
Furthermore, is a subgroup of , so we have that .
Claim.
for all
Proof.
Suppose that . Since and we see that , whence .
Let and consider the inner product
When expanded out it is equal to
Now the first term is at most , the second and third at least and, finally, the fourth is at most
Combining all this tells us that
By Plancherel’s theorem we conclude that
Rearranging it follows that . Thus we are either in case (ii) or else as desired. ∎
Claim.
Proof.
If then since is -almost boolean whence the desired conclusion follows on noting that is a subgroup of . ∎
It follows that has all the claimed properties and we are in case (iv); the proof is complete. ∎
We are now in a position to iterate the above lemma to prove the main theorem.
Proof of Theorem 1.4.
Define the auxiliary parameter to be
We begin as in the proof of Theorem 1.3 and may suppose that is not a subgroup of , or else we are trivially done with , and so it follows from Proposition 2.1 that . Thus
where the passage from the first to the second line is via the Fourier inversion formula.
Now, split into two cases; if then we are done by our previous averaging argument, whence we shall assume that .
We construct a sequence of finite collections of subspaces with
such that
We initialize with which trivially satisfies the above and apply Lemma 7.1 repeatedly. If then we see that
whence each application of the lemma either tells us that (and we are done) or that there is a new subgroup which may be added to to get thus blessed with all the desired properties.
However, it turns out that the iteration must terminate before this stage as we shall now see. Suppose that . Then , whence
by Plancherel’s theorem. Now let have . Then
which is well defined since is a coset of and is constant on cosets of . It follows that
On the other hand whence
Now
whence
and writing we get from the triangle inequality that
On the other hand the sets are disjoint by design and so
It follows that in fact and the iteration terminates. The theorem is proved. ∎
8. Concluding remarks
As noted in the introduction lower bounds on the algebra norm of a set can be converted into lower bounds for by averaging. In view of this it is natural to take the quantitative idempotent theorem of [GS08] and try to derive a version of Theorem 1.4.
Theorem 8.1 (Quantitative idempotent theorem, [GS08, Theorem 1.3]).
Suppose that is an abelian group and is a finite set. Then we may write
where the are subgroups and . Moreover, the number of distinct subgroups is at most .
Of course doing this would require some work (most likely of the type in §2) to take the structure produced by this theorem and convert it into the stronger output of Theorem 1.4 and in any case the most one could hope for would be doubly logarithmic bounds.
Our proof proceeds in a rather different manner from that in [GS08] because we are unable to make use of almost boolean functions in the main iteration. This is largely because Chowla’s problem is even more sensitive to changing sets into functions than the idempotent theorem is, and we have to proceed in a correspondingly more delicate way.
If one had the conjectural best possible version of Theorem 8.1 (where one is allowed to take ) one might hope to recover a lower bound of in Theorem 1.4. Of course one expects the bound to be much stronger and the following is really the interesting question.
Problem.
Show that there is a function with as such that for every non-empty, finite symmetric set there is a set of subgroups of with such that
On a more technical note it is possible to avoid the use of Bourgain systems by working heavily with the large spectrum. Doing this results in a doubly logarithmic bound for Theorem 1.4 because the Fourier space analogue of Proposition 6.2 is not very efficient at encoding the very large correlation that a set has with the associated Bourgain system. In any case, proceeding in this manner does not seem to be of any real benefit.
To close we remark that a number of related questions about the magnitude and arguments of various Fourier modes have been considered in the papers [KL00] and [KL04] of Lev and Konyagin. Interestingly, while our work is very analytic the obstacles in these papers become increasingly algebraic; in [KL00], for example, the properties of norms of algebraic integers are used.
Acknowledgements
References
- [BBR98] J. P. Bell, P. B. Borwein, and L. B. Richmond. Growth of the product . Acta Arith., 86(2):155–170, 1998.
- [Bou86] J. Bourgain. Sur le minimum d’une somme de cosinus. Acta Arith., 45(4):381–389, 1986.
- [Bou02] J. Bourgain. On the distributions of the Fourier spectrum of Boolean functions. Israel J. Math., 131:269–276, 2002.
- [BS94] A. Balog and E. Szemerédi. A statistical theorem of set addition. Combinatorica, 14(3):263–268, 1994.
- [Cho65] S. Chowla. Some applications of a method of A. Selberg. J. Reine Angew. Math., 217:128–132, 1965.
- [ES59] P. Erdős and G. Szekeres. On the product . Acad. Serbe Sci. Publ. Inst. Math., 13:29–34, 1959.
- [Fre73] G. A. Freĭman. Foundations of a structural theory of set addition. American Mathematical Society, Providence, R. I., 1973. Translated from the Russian, Translations of Mathematical Monographs, Vol 37.
- [GK09] B. J. Green and S. V. Konyagin. On the Littlewood problem modulo a prime. Canad. J. Math., 61(1):141–164, 2009.
- [Gow98] W. T. Gowers. A new proof of Szemerédi’s theorem for arithmetic progressions of length four. Geom. Funct. Anal., 8(3):529–551, 1998.
- [GR07] B. J. Green and I. Z. Ruzsa. Freĭman’s theorem in an arbitrary abelian group. J. Lond. Math. Soc. (2), 75(1):163–175, 2007.
- [GS08] B. J. Green and T. Sanders. A quantitative version of the idempotent theorem in harmonic analysis. Ann. of Math. (2), 168(3):1025–1054, 2008.
- [GT09] B. J. Green and T. C. Tao. A note on the Freĭman and Balog-Szemerédi-Gowers theorems in finite fields. J. Aust. Math. Soc., 86(1):61–74, 2009.
- [KL00] S. V. Konyagin and V. F. Lev. On the distribution of exponential sums. Integers, pages A1, 11 pp. (electronic), 2000.
- [KL04] S. V. Konyagin and V. F. Lev. Character sums in complex half-planes. J. Théor. Nombres Bordeaux, 16(3):587–606, 2004.
- [Kon81] S. V. Konyagin. On the Littlewood problem. Izv. Akad. Nauk SSSR Ser. Mat., 45(2):243–265, 463, 1981.
- [MPS81] O. C. McGehee, L. Pigno, and B. Smith. Hardy’s inequality and the norm of exponential sums. Ann. of Math. (2), 113(3):613–618, 1981.
- [Rot73] K. F. Roth. On cosine polynomials corresponding to sets of integers. Acta Arith., 24:87–98, 1973. Collection of articles dedicated to Carl Ludwig Siegel on the occasion of his seventy-fifth birthday, I.
- [Rud90] W. Rudin. Fourier analysis on groups. Wiley Classics Library. John Wiley & Sons Inc., New York, 1990. Reprint of the 1962 original, A Wiley-Interscience Publication.
- [Ruz04] I. Z. Ruzsa. Negative values of cosine sums. Acta Arith., 111(2):179–186, 2004.
- [Spe85] J. Spencer. Six standard deviations suffice. Trans. Amer. Math. Soc., 289(2):679–706, 1985.
- [TV06] T. C. Tao and H. V. Vu. Additive combinatorics, volume 105 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2006.