Equidistribution of exponential sums indexed by a subgroup of fixed cardinality

Abstract We consider families of exponential sums indexed by a subgroup of invertible classes modulo some prime power q. For fixed d, we restrict to moduli q so that there is a unique subgroup of invertible classes modulo q of order d. We study distribution properties of these families of sums as q grows and we establish equidistribution results in some regions of the complex plane which are described as the image of a multi-dimensional torus via an explicit Laurent polynomial. In some cases, the region of equidistribution can be interpreted as the one delimited by a hypocycloid, or as a Minkowski sum of such regions.

for any integers a and b.Throughout this article, we use the notation e(z) for exp(2iπz) and x −1 for the inverse of x modulo q.These sums satisfy the bound 1 : which is a consequence of Weil's work on the Riemann hypothesis for curves over finite fields when α = 1, and elementary computations when α 2 (see [Kel10,Corollary 1]).This raises the question of the distribution of the sets of sums ín the interval [−2, 2] as q goes to +∞.A result due to Katz asserts that the sets of sums ¶ 1 √ p K p (a, 1); a ∈ F × p © become equidistributed with respect to the Sato-Tate measure on [−2, 2]: as p → +∞ through primes (see [Kat88,Example 13.6] for this specific statement).This relies on Deligne's equidistribution theorem and involves deep notions of algebraic geometry.
In the case where q = p α is a non-trivial prime power (i.e.α 2), one can prove via elementary methods an equidistribution result for the sets ¶ 1 √ q K q (a, 1); a ∈ (Z/qZ) × © as q goes to infinity, see [Kel10, Remark 1.1].In this case, the measure with respect to which the sums become equidistributed is the measure µ defined as follows: The following figure illustrates these two different behaviours.  1 Here one really needs to assume that p is an odd prime.When q = 2 α with α 5, the upper bound (1) needs to be replaced by |Kq(a, b)| (2 √ 2) √ q (see the corrigendum [FM06] to the article [FM03]).

Equidistribution of sums indexed by a subgroup
The aim of this work is to study the question of the distribution of sums indexed by a subgroup of (Z/qZ) × .This question is motivated by the equidistribution results already known for complete sums, such as the ones presented in the previous section, as well as the appealing figures shown in the articles [DGL15, BCC + 16] and [GHL15].In the latter, the authors fix an integer d and introduce the "restricted" geometric sums: Then, the equidistribution of the sets {S q (a, d); a ∈ Z/qZ} as q tends to infinity is investigated.In order to avoid degenerate cases in the index set of the sum defining S q (a, d) and other sums in the remainder of this article, we make the following definition.
Definition 1.1.An integer q will be called d-admissible if it is of the form p α for some odd prime number p congruent to 1 modulo d, and some integer α 1.We denote by A d the set of d-admissible integers.
If q is d-admissible, then the group (Z/qZ) × has a unique subgroup of order d, explicitly described as {x ∈ (Z/qZ) × ; x d = 1}.Thus, the sum in (2) can be interpreted as the one indexed by the unique subgroup of order d of (Z/qZ) × .
In order to state the equidistribution result proved in [GHL15, DGL15], we need one last definition.
Definition 1.2.Let d 1.For all k ∈ {0, . . ., d − 1}, we denote by (c j,k ) 0 j<ϕ(d) the coefficients of the remainder in the euclidean division of X k by φ d , the d th cyclotomic polynomial over Q; precisely, these coefficients are defined by the property Then, we define the Laurent polynomial With these notations, the main theorem of [GHL15,DGL15] on the asymptotic behaviour of sums of type (2) can be stated as follows.In loc.cit. the theorem is stated as a density result, but the proof actually shows that equidistribution holds with respect to the appropriate pushforward measure.
Theorem 1.3 ([GHL15, Theorem 1] and [DGL15, Theorem 6.3]).Let d 1.The sets {S q (a, d); a ∈ Z/qZ} become equidistributed in the image of g d with respect to the pushforward measure of the probability Haar measure λ on T ϕ(d) via g d , as q goes to infinity among the d-admissible integers.
In other words, for any continuous map F : Besides, it was proved in [BCC + 16, Theorem 7 and Theorem 10] that when d is a prime number or d = 9, the same equidistribution result holds for the sets of restricted Kloosterman sums K q (a, b, d); a, b ∈ (Z/qZ) 2 , where Finally, for some specific values of the integer d such as primes and prime powers, one can give a geometric interpretation of the image of g d in terms of hypocycloids.
Definition 1.4.The d-cusp hypocycloid is the curve given by the image of: It is a curve described by a point of a circle of radius 1 rolling inside a circle of radius d.Note that the 2-cusp hypocycloid is just the interval [−2, 2], so it does not really enclose an area of the complex plane.Thus H 2 is simply the interval [−2, 2] as well.
When d is a prime, an explicit computation of g d leads to [GHL15, Proposition 1], which states that the image of g d is the region H d .This yields a more concrete form of Theorem 1.3.
as q goes to infinity among the d-admissible integers.The same statement holds for the sets of sums K q (a, b, d); a, b ∈ (Z/qZ) 2 .
The following picture illustrates the asymptotic behaviour predicted by this theorem in the case of Kloosterman sums.The aim of this article is to generalize theorems 1.3 and 1.6 to more general families of exponential sums, and to study the question of restricting the parameters a, b indexing the sums K q (a, b, d), or generalizations of these, to certain specific subsets of (Z/qZ) 2 , while preserving the equidistribution result.
Another motivation for studying exponential sums restricted to multiplicative subgroups comes from the article [Shk14], where considerations on sums over subgroups of F × p lead to a new upper bound on Heilbronn's exponential sums.However, in the latter the size of the subgroups grows with p, so our problem will be quite different since we will be working with sums indexed by a subgroup of fixed cardinality.

Statement of the main result
The study of the equidistribution of sets of sums of type (2) and (3) can be seen as a particular case of the following question: given a sequence (F q ) q∈A d indexed by the d-admissible integers (Definition 1.1), where each F q is a set of Laurent polynomials with coefficients in Z/qZ, what can be said about the distribution of the sets of sums as q goes to infinity among the d-admissible integers?In (2), it is the case where F q = {aX; a ∈ Z/qZ} whereas (3) corresponds to the case where As Theorem 1.6 shows, both cases surprisingly lead to the same regions of equidistribution, at least in the case where d is a prime number.Thus, it is natural to ask whether these results extend to more general Laurent polynomials.
Our main result (Theorem A) generalizes these known cases.In order to state it we first define a few extra quantities.
Definition 1.7.Let d 1 be an integer, and let m = (m 1 , . . ., m n ) ∈ Z n .We say that m is coprime with d if all the m i are coprime with d.
Definition 1.8.Given m = (m 1 , . . ., m n ) ∈ Z n and q 1, we denote by F m,q the following set of Laurent polynomials with coefficients in Z/qZ: In case (b) of Theorem A and Proposition B, we will see that the key argument which explains why sets of type (2) and (3) become equidistributed in the same regions of the complex plane is that the corresponding m is coprime with d, for any d.Indeed, in case (2) we have m = (1) ∈ Z and in case (3) we have m = (1, −1) ∈ Z 2 .Even though we will also treat the case where m is not coprime with d, this observation is the starting point that led us to the generalizations that we prove in the current work.Precisely we focus on the distribution of the following sets of sums: In other words, these are sets of exponential sums of the form (4) with F q equal to F m,q for some m ∈ Z n .In fact we prove a more general result by showing that it is possible to impose strong restrictions on the set of parameters and still obtain equidistribution.Our main result is indeed concerned with sets of sums of the form where the q are sufficiently large subgroups of (Z/qZ) × .
We finally define the relevant Laurent polynomials that will come into play in the description of the region of equidistribution of sets of type (5) and (6) in the case where m is not coprime with d.
Definition 1.9.Let d 1 and let m = (m 1 , . . ., m n ) ∈ Z n .For all i ∈ {1, . . ., n}, we denote by the coefficients that appear in the reduction modulo φ d i of X k for each k in {0, . . ., d − 1}.In other words, these are the unique integers such that: Then we define the Laurent polynomial f d,m as follows: We can now give the statement of the main result.
Theorem A. Let d 1 be an integer and let m = (m 1 , . . ., m n ) ∈ Z n .For all d-admissible integer q, we fix subgroups H (1) q , . . ., H (n) q of (Z/qZ) × .Then we have the following equidistribution results: (a) The general case.
If there exists δ > 0 such that the subgroups H (1) q , . . ., H (n) q satisfy the growth condition: ∀i ∈ {1, . . ., n}, then the sets (6) become equidistributed in the image of the Laurent polynomial f d,m (Definition 1.9) with respect to the pushforward measure via f d,m of the probability Haar measure λ on T ϕ(d 1 )+•••+ϕ(dn) , as q goes to infinity among the d-admissible integers.In other words, if we denote by I d,m the image of f d,m and by µ := (f d,m ) * λ, then for all continuous function F : If there exists δ > 0 such that the subgroups H (1) q , . . ., H (n) q satisfy the growth condition: then the sets (6) become equidistributed in the image of the Laurent polynomial g d (Definition 1.2) with respect to the pushforward measure via g d of the probability Haar measure on T ϕ(d) , as q goes to infinity among the d-admissible integers.
For instance, if one takes m = (1, −1), the second case of this theorem states that the sets ¶ satisfy the same equidistribution result as the sets of Figure 3, as soon as the q satisfy the growth condition (9).In other words, restricting the parameters a, b to large enough multiplicative subgroups does not introduce any bias in the distribution of the restricted Kloosterman sums, and still ensures equidistribution with respect to the same measure as in Theorem 1.6.We give an illustration of this fact in section 5.2.
Remark 1.10.We will also discuss the possibility to fix some of the parameters, while letting the other vary.For instance, this means that we will consider sets of the form (6) but with the condition (a 1 , . . ., a n ) ∈ H (1) for some s < n, while the other parameters a j are fixed integers (see Remark 4.2).
Finally, the equidistribution result of Theorem A, concerning sets of type (6), admits an analogue for sets of type (5), via a simple adaptation of the proof.Precisely, we will obtain the following proposition, which generalizes [BCC + 16, Theorem 7] and [DGL15, Theorem 6.3].
(a) The general case.
The sets of sums (5) become equidistributed in the image of the Laurent polynomial f d,m (from Definition 1.9) with respect to the pushforward measure via f d,m of the probability Haar measure on T ϕ(d 1 )+•••+ϕ(dn) , as q tends to infinity among the d-admissible integers.
(b) When m is coprime with d.Let s ∈ {1, . . ., n} and let {i 1 , . . ., i s } ⊆ {1, . . ., n}.We fix n − s integers a i for i ∈ {1, . . ., n} \ {i 1 , . . ., i s }.Then the sets of sums become equidistributed in the image of g d (with respect to the pushforward measure via g d of the probability Haar measure on T ϕ(d) ) as q goes to infinity among the d-admissible integers.
If one takes m to be equal to (1) ∈ Z or (1, −1) ∈ Z2 , then the second case of this proposition allows one to recover Theorem 1.3 as well as Theorem 1.6 extended to values of d which are not prime.In particular, the asymptotic behaviour shown in Figure 3 is an illustration of Proposition B (b) in the case of Kloosterman sums.We give other examples of application in section 5.3.
Remark 1.11.The Laurent polynomial g d does not depend on m, as long as m is coprime with d.This implies that the region of equidistribution almost does not depend on the shape of the numerators in the exponentials: it will be the same for any m coprime with d.This explains why [BCC + 16, Theorem 7] and [DGL15, Theorem 6.3] give rise to the same kind of figures, and this leads to many other examples.Similarly, the Laurent polynomial f d,m only depends on m through the list of the gcd's (d, m i ).

Strategy of the proof of Theorem A.
The first step consists in reducing both cases to two statements about the equidistribution modulo 1 of some sets of arithmetic nature: propositions 2.2 and 2.5.These two propositions can be seen as a generalization of Myerson's lemma 2 , which asserts that the sets where w q is a primitive d-th root of unity modulo q, become equidistributed modulo 1 as q goes to infinity among the d-admissible integers.This lemma is proved using a version of Weyl's equidistribution criterion and thus reduces to the following exponential sum estimate: Lemma 1.12 (Myerson's lemma, [DGL15, Lemma 6.2]).Let d 1 be an integer, and let f ∈ Z[X]\{0} be a polynomial of degree strictly less than ϕ(d).Then there exists an integer m f such that for all dadmissible integer q such that q > m f , for any element w q of order d in (Z/qZ) × , a∈Z/qZ e Å f (w q ) q a ã = 0.
Propositions 2.2 and 2.5 essentially amount to generalizing the equidistribution of sets of type (11) to sets of the form ß a q where H q is a large enough subgroup of (Z/qZ) × .Precisely, a particular case of Proposition 2.5 is the following corollary which generalizes [DGL15, Lemma 6.2].
Corollary 1.13.Let d 1 and let δ > 0. For all q ∈ A d , let w q be an element of order d in (Z/qZ) × .For each of these values of q, we also fix a subgroup H q of (Z/qZ) × .If the following growth condition is satisfied: then the sets (12) become equidistributed modulo 1 as q tends to infinity among the d-admissible integers.
The crucial input in order to obtain convergence towards zero when applying Weyl's criterion is the following exponential sum estimate, which relies on a deep result due to Bourgain and stated in Theorem 3.1.
Let δ > 0.Then, there exists ε = ε(δ) > 0, depending only on δ, such that for all d-admissible integer q large enough, for all subgroup H q of (Z/qZ) × satisfying |H q | q δ , and for any element w q of order d inside (Z/qZ) × , we have This estimate allows us to complete the proofs of propositions 2.2 and 2.5, thus proving Theorem A. Let us stress that the application of Bourgain's theorem is not straightforward, and the second main ingredient in the proof of Proposition 1.14 is a good understanding of the p-adic valuation of f (w q ) (see Proposition 3.2).
Structure of the paper.Section 2 is devoted to reducing the proof of the main result to statements about equidistribution modulo 1.In Section 3, we prove the key exponential sum estimate (Proposition 1.14) which allows us to obtain the convergence towards zero in the applications of Weyl's criterion of Section 4. In the latter, we establish the needed properties of equidistribution modulo 1 and conclude the proof of Theorem A. Finally in Section 5, we give examples and illustrations.

Notations
• The number of elements of a finite set X is denoted by |X|.
• If a, b ∈ Z, we denote by (a, b) their gcd (greatest (positive) common divisor).
• If a ∈ Z and p is a prime number, we denote by v p (a) the p-adic valuation of a.
• If d is a positive integer, φ d denotes the d th cyclotomic polynomial over Q and ϕ(d) its degree.
• Let (X, A ) and (Y, B) be two measurable spaces, and let λ be a measure on the former.If f : X → Y is (A , B)-measurable, then we denote by f * λ the pushforward measure of λ via f .It is defined as the measure on (Y, B) such that • T denotes the group of complex numbers of modulus 1.
The Jupyter Notebook which was written to obtain most of the figures of this article is available in html format at the URL: http://perso.eleves.ens-rennes.fr/people/theo.untrau/sumssubgroups Acknowledgements.The author would like to thank Guillaume Ricotta and Florent Jouve for suggesting this question, and for the helpful discussions all along this work.We also thank Étienne Fouvry and Emmanuel Kowalski for their comments on a preliminary version of the article.The pictures were made with the open-source software sagemath: [The20].

Reduction to statements on equidistribution modulo 1
In this section, we prove that the two cases of Theorem A are implied by two lemmas on the equidistribution modulo 1 of certain sequences of sets of arithmetic nature.The idea is that the exponential sums we are considering, which are sums of d particular roots of unity, can in fact be expressed as a Laurent polynomial in a smaller number of roots to unity.We start this section by stating a lemma which is the main ingredient to perform this reduction.

Reduction modulo prime powers of cyclotomic polynomials
Lemma 2.1.Let d 1 be an integer and let q = p α be a d-admissible integer.Let x ∈ (Z/qZ) × be an element of order d.Then we have: where φ d stands for the reduction of φ d modulo q.
Proof.We consider the polynomial P (X) := X d − 1, seen as an element in Z p [X], where Z p is the ring of p-adic integers.Let x be a lift in Z of the class x modulo q.Then we have P (x) ≡ 0 mod q since x has order d.Therefore |P (x)| p 1 p α , where we denoted by | • | p the standard p-adic absolute value on the field of p-adic numbers Q p .On the other hand, we have P (x) = dx d−1 , which has p-adic valuation zero since (d, p) = 1 (because d divides p − 1) and (x, p) = 1 since x is invertible modulo p α .Thus, |P (x)| p = 1 and so: Therefore, by Hensel's lemma (see [CF10, chapter II, appendix C]) there exists a unique z ∈ Z p such that We deduce that: Now since Z p is an integral domain, at least one of the factors φ m (z) must be zero.Assume for a contradiction that this happens for an m which is not equal to d.Then this would imply that zm = 1 in Z p , hence: by the second condition in (14).Thus, xm ≡ 1 mod p α for an m < d, contradicting the fact that x has order exactly d in (Z/p α Z) × .Therefore, in the product (15), it is the term φ d (z) which equals zero.Now, since |x − z| p 1 p α we have: and this is equivalent to φ d (x) ≡ 0 mod p α , that is: In the remainder of this section, we state two lemmas on the equidistribution modulo 1 of some particular sets, and prove that they imply Theorem A.

Reduction step for the main result: case (a)
First, let us state the proposition which will turn out to imply case (a) of Theorem A.
Remark 2.3.There is a little abuse of notation here, since the a i and w q are classes modulo q, and the fractions above may depend on the choice of a representative.However, since we are only interested in the distribution properties modulo 1, we sometimes allow ourselves to keep on writing classes modulo q at the numerator of fractions with denominator equal to q.
This lemma on equidistribution modulo 1 translates into a result on equidistribution of exponential sums restricted to a subgroup via the Laurent polynomials f d,m introduced in equation ( 7) of Definition 1.9.For all d-admissible integer q, let Y m,q := H q be a product of subgroups of (Z/qZ) × as in case (a) of Theorem A (that is: satisfying the growth condition (8)) and let θ m,q : Y m,q → C be the map defined by We want to show that, assuming Proposition 2.2, we have for any F : Let w q be an element of order d in (Z/qZ) × .Then the unique subgroup of order d inside (Z/qZ) × can be described as w k q ; k ∈ {0, . . ., d − 1} , so that for all (a 1 , . . ., This comes from using lemma 2.1 after having evaluated the polynomial congruences defining the c (see Definition 1.9) at w m i q .The lemma applies since w m i q has order d i in (Z/qZ) × .Replacing this in the expression of θ m,q (a 1 , . . ., a n ) obtained above, we get: .
Therefore, if we define for all i ∈ {1, . . ., n} and for all j ∈ {0, . . ., ϕ(d i ) − 1}, with the Laurent polynomial f d,m from Definition 1.9, and the z i,j being elements of T. This already shows that θ m,q (a 1 , . . ., a n ) belongs to the image of f d,m .Now, let us prove that the equidistribution statement.Let F : I d,m → C be a continuous function.
Thanks to (18), the left-hand side of (17) may be rewritten as and this converges to F dµ by proposition 2.2 and because µ = (f d,m ) * λ.This finishes the proof of (17).Thus, Theorem A (a) indeed follows from Proposition 2.2.

Reduction step for the main result: case (b)
As in the previous case, let us begin with the statement of the proposition which will imply case (b) of Theorem A.
Proposition 2.5 (Equidistribution modulo 1 case (b)).Let d 1 be an integer and m = (m 1 , . . ., m n ) ∈ Z n be a vector coprime with d.Let δ > 0. For all d-admissible integer q, let w q be an element of order d in (Z/qZ) × .For each q, we also choose subgroups of (Z/qZ) × : H (1) q , . . ., H (n) q .Then, provided for all q, there exists i ∈ {1, . . ., n} such that become equidistributed modulo 1 as q goes to infinity among the d-admissible integers.
Corollary 1.13, which generalizes the classical Myerson's lemma stated in the introduction, is obtained as the special case where m = (1).
The Laurent polynomials g d introduced in Definition 1.2 will carry the equidistribution result of Proposition 2.5 to the equidistribution theorem for exponential sums we are aiming at.This is the content of the following proposition.
Proof.We still denote by Y m,q := H (1) q and by θ m,q the map defined in (16).We assume that the subgroups H (i) q satisfy the growth condition (9) instead of (8).Thanks to the proof of Proposition 2.4 we have that for all (a 1 , . . ., a n ) ∈ Y m,q , where the integers c (i) j,k are defined as in Definition 1.9.However, in the case where m is coprime with d, all the d i are equal to d.This implies that for all i, the list of integers (c . So if we define for all j ∈ {0, . . ., ϕ(d) − 1}, we have θ m,q (a 1 , . . ., a n ) = g d (z 0 , . . ., z ϕ(d)−1 ), with the Laurent polynomial g d defined at Definition 1.2 and the z j being elements of T. This shows that θ m,q (a 1 , . . ., a n ) belongs to the image of g d .Finally, the argument to prove the equidistribution with respect to the appropriate pushforward measure is the same as in the proof of Proposition 2.4, with Proposition 2.5 playing the role of Proposition 2.2.
In the next section, we prove the key exponential sum estimate which will allow us to prove Proposition 2.2 and Proposition 2.5 using Weyl's equidistribution criterion.

Improved versions of Myerson's lemma
In the previous section, we proved that Theorem A (b) reduces to a statement on the equidistribution modulo 1 of some specific sets of ϕ(d)-tuples.For instance when m = (1), Proposition 2.5 reduces to the study of the distribution modulo 1 of sets of the form where H q is a sufficiently large subgroup of (Z/qZ) × and w q is an element of order d in (Z/qZ) × (see Corollary 1.13).This can be seen as a generalization of [DGL15, Lemma 6.2], which concerns sets of the form If one wants to go from the equidistribution modulo 1 of sets of the form (22) to that of sets of the form (21), this can become quite technical when the subgroup H q is small.More precisely, the equidistribution modulo 1 of sets of the form (21) can be proved by elementary means as long as the subgroups H q satisfy the growth condition (see [Unt]) √ q However, as explained in [Kur07], improving upon the range "|H q | grows faster than √ q" requires more difficult techniques, and the best known bounds come from deep results from additive combinatorics.In this section, we will prove the key exponential sum estimate which allows us to prove the equidistribution modulo 1 of the sets (21) for very small subgroups H q .Precisely, it will give us the fact that the growth condition (23) can be replaced by for any fixed δ > 0, which represents a huge improvement.This relies on a theorem due to Bourgain, that we state in the next subsection.

Bourgain's theorem
In a series of articles, Bourgain, Chang, Glibichuk and Konyagin proved very strong estimates on sums of additive characters modulo q over subgroups of (Z/qZ) × , for different forms of factorization of q.The case where q is prime is proved in [BGK06], while the case of prime powers with bounded exponent is settled in [BC06].This series of works culminated with the following theorem, which treats the general case, and includes in particular the case of small primes raised to very high powers.Notice that since we are only dealing with moduli which are prime powers, the proof of the result we really use is contained in Part I of [Bou05].

The crucial control of the p-adic valuation
In order to apply the previous theorem in our specific context, the following proposition plays an important role.
For all d-admissible integers q, we choose an element w q of order d in (Z/qZ) × , and an arbitrary lift wq in Z. Then there exist two constants C f , n f 1 such that for all q = p α ∈ A d such that q > n f , (a) q does not divide f ( wq ).
Proof.As in the proof of [DGL15, Lemma 6.2], we use the fact that there exist two polynomials a, b ∈ Z[X] and an integer n 1 such that since f and φ d are coprime in the euclidean domain Q[X].Now, let q = p α be a d-admissible integer.
Reducing equation ( 25) modulo q and evaluating it at w q leads to a(w q )φ d (w q ) + b(w q )f (w q ) ≡ n mod p α hence b(w q )f (w q ) ≡ n mod p α (26) by Lemma 2.1.Now, if q = p α > n, then n is non-zero modulo q, hence f (w q ) ≡ 0 mod q.This precisely means that q does not divide f ( wq ).This shows that n f := n is a suitable constant for assertion (a).This part of the lemma actually completes the proof of Lemma 1.12.
Another way of phrasing what we just proved is that as soon as q > n, the p-adic valuation of f ( wq ) is strictly less than α.Let us denote by γ < α the p-adic valuation of f ( wq ).Then, if we reduce the congruence (26) modulo p γ , we get n ≡ 0 mod p γ .Thus, Therefore, we proved that with the choice C f := n, assertion (b) holds.Now, let us use this proposition, together with Theorem 3.1, to deduce the key exponential sum estimate which will be used in the proofs of Proposition 2.2 and Proposition 2.5.

Proof of the key exponential sum estimate: Proposition 1.14
Let q = p α be a d-admissible integer, and let H q and w q be as in the statement.Let wq be any lift in Z of the class w q .Assume further that q > n f for any constant n f as in Proposition 3.2.One cannot directly apply Bourgain's theorem to the sum on the left-hand side of (13) because f (w q ) could be non-invertible modulo q.In order to reduce to a situation where Bourgain's theorem applies, let us introduce the notation β q for the p-adic valuation of f ( wq ), and write f ( wq ) := p βq r q .By Proposition 3.2 (a), β q < α.Then we have Now, each of the terms e arq p α−βq only depends on the class of a modulo p α−βq .Let us denote by q := p α−βq and by π the group homomorphism (Z/qZ) × → (Z/q Z) × induced by the reduction modulo q .The latter induces a group homomorphism π : H q → π(H q ) =: H q .We denote by k := | ker π|.Then we have the following equality: Indeed, any element of H q has exactly k preimages in H q under the reduction modulo q .Since ker π ⊆ ker π, we have that k | ker π| = p βq .Therefore, In order to apply Theorem 3.1 to the sum on the right-hand side, we first need to check that the subgroup H q of (Z/q Z) × is large in the following sense: |H q | (q ) δ for some δ > 0. Using the fact that |H q | q δ , we have where the last lower bound comes from the inequality p βq C f given by Proposition 3.2 (b).This inequality also ensures that q tends to infinity as q goes to infinity, so that (q )   δ 2 C 1−δ f eventually becomes greater than 1 as q becomes large.Therefore, for all q large enough.Thanks to (29), Theorem 3.1 applies to the sum on the right-hand side of (28), because we also have that r q is invertible modulo q .So there exists a constant ε = ε(δ/2) > 0 and a constant C depending at most on δ such that Thanks to ( 27) and (28), this implies the following upper bound: which concludes the proof.
Let us denote by y 1 the vector extracted from y by taking the first ϕ(d 1 ) entries, y 2 the vector formed by the next ϕ(d 2 ) entries and so on: so that y = (y 1 , . . ., y n ).We also introduce the following notations to decompose the vector x(a 1 , . . ., a n , q) in a parallel way: , . . ., x n (a n , q) := Ç a n (w mn q ) j q å 0 j<ϕ(dn) Then we have e (x(a 1 , . . ., a n , q) • y) Now, since y = 0, there exists at least one index i ∈ {1, . . ., n} such that y i = 0.For such an i, the factor 1 tends to 0 as q goes to infinity among the d-admissible integers thanks to Proposition 1.14.Indeed, we have 1 where f i is the polynomial associated with . This is a non-zero polynomial with integer coefficients and with degree strictly less than ϕ(d i ), and w m i q is an element of order d i in (Z/qZ) × .Thus, we can apply Proposition 1.14 which states that there exists a rank N f i such that for all q > N f i such that q is d-admissible, and this suffices to prove the convergence of (32) towards zero.As all the other factors of (31) have absolute value bounded above by 1, the whole product converges to zero, and this concludes the proof.
Remark 4.1.The proof shows why it is important to ask for the growth condition (8) instead of (9) (that will be used in the next proof).Indeed, let us fix an index j ∈ {1, . . ., n}.Then if we take y = (y 1 , . . ., y n ) ∈ Z ϕ(d 1 )+•••+ϕ(dn) \ {0} defined by y i = (0, . . ., 0) ∈ Z ϕ(d i ) for all i = j and y j = (1, . . ., 1) ∈ Z ϕ(d j ) , then the absolute value of the product (31) is equal to the absolute value of the factor corresponding to the index j, since all the other factors are equal to 1. Therefore, to prove the convergence towards zero in Weyl's criterion for this specific vector y, we have no other choice than proving that the factor corresponding to the index j tends to 0. In order to achieve that, we really need to be able to apply Proposition 1.14 to this factor, hence we really need to require |H (j) q | q δ .As j was arbitrary, this shows that the growth condition needs to be satisfied for all j ∈ {1, . . ., n}.

Proof of Proposition 2.5 (Equidistribution modulo 1 case (b))
We are interested in the equidistribution modulo 1 of the following sets of ϕ(d)-tuples: where the q are subgroups of (Z/qZ) × satisfying the growth condition By Weyl's criterion, these sets become equidistributed if and only if for any y := y 0 , . . ., y ϕ(d)−1 ∈ Z ϕ(d) \ {0} we have the following convergence towards zero:

an)∈H
(1) But the left-hand side can be rewritten as: where f is the polynomial y Now, since (m i , d) = 1, we have that for all i ∈ {1, . . ., n} the element w m i q is still of order d in (Z/qZ) × .Also, f ∈ Z[X] \ {0} and deg f < ϕ(d).Thus, we can use Proposition 1.14 to bound the modulus of the inner sum for any index i such that |H (i) q | q δ (and there exists at least one such index i thanks to the growth condition (33)).We deduce that there exists an integer N f such that for all q > N f such that q is d-admissible, we have: for at least one i ∈ {1, . . ., n}, which may vary with q.As the other factors in the product (35) have absolute value bounded above by one, we may conclude that the whole product has its modulus bounded above by 1/q ε (up to multiplicative constants), hence the conclusion.

Conclusion of the proof of Theorem A.
In this section, we proved Proposition 2.2 and Proposition 2.5, and each of them implies one of the cases of Theorem A thanks to propositions 2.4 and 2.6.This completes the proof of our main result.

Remarks on Theorem A and connexion with previous results
Remark 4.2.There is one last refinement that we did not discuss so far but that can be observed through the proofs: it is the fact that one can fix some of the coefficients a i when one studies the equidistribution of the restricted sums in the case where the m i are coprime with d.This remark is not included in Theorem A (b) because the statement was already quite long without it.Let s ∈ {1, . . ., n} and let {i 1 , . . ., i s } ⊆ {1, . . ., n}.We fix n − s integers a i for i ∈ {1, . . ., n} \ {i 1 , . . ., i s }.Then the sets of sums: (in other words, the ones where only some of the a i are free) become equidistributed in the image of g d with respect to the same measure as in Theorem A (b) provided there exists δ > 0 such that Indeed, when one reduces this question to an equidistribution result modulo 1 as in section 2.3, one needs to prove that the sets q ™ become equidistributed modulo 1.After applying Weyl's criterion, one gets a factor with complex absolute value equal to 1, multiplied by the product which tends to zero under condition (37), thanks to Proposition 1.14.
Remark 4.3.If we take the subgroups q as large as possible, Theorem A gives an equidistribution result for the sets of sums However, to compare our result to the ones already proved in [DGL15,GHL15] and [BCC + 16], we would like to have the a i varying in Z/qZ instead of (Z/qZ) × .This is the content of Proposition B. In order to obtain this proposition, the first step consists in following the strategy of section 2 to reduce to two statements on equidistribution modulo 1, corresponding to the two cases (a) and (b) of the proposition.These two statements are the exact analogues of Proposition 2.2 and Proposition 2.5, with the condition (a 1 , . . ., a n ) ∈ H (1) replaced by (a 1 , . . ., a n ) ∈ (Z/qZ) n .They are proved using Weyl's criterion, but the convergence towards zero is easier to obtain, since Lemma 1.12 replaces the use of Proposition 1.14.For instance, Proposition B (b) reduces to the convergence towards zero of the following product i∈{i 1 ,...,is}   1 q where f is a non-zero polynomial in Z[X] with deg f < ϕ(d).This product is to Proposition B (b) what (38) was to Theorem A (b), in its extended form of the previous remark.Now, thanks to Lemma 1.12 each of the factors in (39) is eventually equal to zero as q ∈ A d goes to infinity, and this finishes the proof.Proposition B (a) can be proved by a similar adaptation of the proof of Theorem A (a).
This proposition generalizes the previous results obtained in [DGL15,GHL15] and [BCC + 16].In these articles, only sums of the type e Å ax + bx −1 q ã were considered.In Proposition B (b), we prove that the equidistribution theorems obtained in loc.cit.extend to families of sums with a more general numerator inside the exponentials, namely Laurent polynomials of the form a 1 x m 1 +• • •+a n x mn , as soon as the exponents m i are coprime with d.Moreover, it also explains that one can fix some of the coefficients a i .As long as one of them varies in all Z/qZ, the equidistribution result will hold.In particular, the equidistribution results obtained in [BCC + 16] for sets of Kloosterman sums also hold if one fixes an integer a 0 , and considers the sets K q (a 0 , −, d) := {K q (a 0 , b, d); b ∈ Z/qZ} .
Finally, case (a) treats the case where some of the m i may share prime factors with d, and provides the appropriate Laurent polynomial whose image determines the region of equidistribution.

Laurent polynomials and hypocycloids
So far, the region of the complex plane in which the sums become equidistributed has only been described as the image of a torus via a Laurent polynomial.However, in some cases, one can give a more explicit description of this image, as it was observed in [GHL15, BCC + 16].In this section, we review some cases where the regions of equidistribution can be described in geometric terms, without referring to the Laurent polynomials g d .The main ingredient is the following lemma, which states that the region H d from Definition 1.5 is precisely the image of a torus via a specific Laurent polynomial.
Lemma 5.1.Let d 2. The image of the map: is the region H d from Definition 1.5.
Proof.See [Coo07, Theorem 3.2.3]or [Kai06, section 3].Note that this is equivalent to asking the question: "which complex numbers arise as the trace of a matrix in SU(d)?" The above Laurent polynomial arises in our equidistribution results in the following way: when d is a prime number, the d th cyclotomic polynomial φ d is equal to X d−1 + • • • + X + 1, and this explicit formula allows one to compute the coefficients c j,k which appear in the definition of g d (Definition 1.2).This exactly gives the Laurent polynomial of the previous lemma, thus allowing us to have a more concrete description of the region of equidistribution in our results.Precisely, this gives: Proposition 5.2 ([GHL15, Proposition 1]).Let d be a prime number.The polynomial g d from Definition 1.2 is given by and the image of T d−1 via g d is the region H d from Definition 1.5.In particular, the region of the complex plane in which the sums restricted to the subgroup of order d become equidistributed in Theorem A (b) and Proposition B (b) is H d .
This proposition relies mostly on the fact that when d is a prime number, we have an explicit formula for the d th cyclotomic polynomial.As there is also an explicit formula for the d th cyclotomic polynomial when d = r b is a prime power, namely it is not surprising that our understanding of the image of g d can also be improved in that case.In fact, the explicit formula above leads to the following proposition.and the image of T ϕ(d) via g d is the Minkowski sum In particular, the region of the complex plane in which the sums restricted to the subgroup of order d become equidistributed in Theorem A (b) and Proposition B (b) is Example 5.4.For instance, as it is done in [BCC + 16, Theorem 10], for r = 3 and b = 2 we have: • A drawing of the region of the complex plane H 3 + H 3 + H 3 can be found in [GHL15, Figure 11].We illustrate this statement in the case d = 3.In the figure below, the blue points are the sets S q (−, 3) while the red curve is the 3-cusp hypocycloid from Definition 1.4.for all d-admissible integer q.As soon as d is odd, it is coprime with the exponents of X that appear in the polynomials of the form aX 4 + bX 2 + cX.
Therefore, Proposition B (b) applies to this family of sums, as long as the summation is restricted to a subgroup of odd order.So if we look at the case d = 3 and we draw the sets Q q (−, −, −, 3) = {Q q (a, b, c, 3); a, b, c ∈ Z/qZ} for different 3-admissible values of q, we observe the same equidistribution as for the other types of sums, inside a 3-cusp hypocycloid.
(a) q = 67 (b) q = 157 (c) q = 307 One could also want to consider sets of Birch sums restricted to a subgroup, that is: For instance if we take d = 7 and look at the sets B q (−, −, 7) := {B q (a, b, 7); a, b ∈ Z/qZ}, then Proposition B (b) (combined with Proposition 5.2) states that they should become equidistributed in H 7 (the region delimited by a 7-cusp hypocycloid) as q goes to infinity among the 7-admissible integers.This is indeed what the following pictures suggest: Remark 5.5.Note that in Theorem A and Proposition B, the measure with respect to which the sums become equidistributed is the pushforward measure via g d of the Haar measure on T ϕ(d) .This explains why one does not observe a "uniform" distribution in the sense of the Lebesgue measure.
On the other hand, one could want to consider Birch sums restricted to the subgroup of order 3, that is sums of the type: become equidistributed in the image of g 9 , with respect to the pushforward measure of the Haar measure on T 6 .Now, thanks to Proposition 5.3 we can interpret the image of g 9 as the Minkowski sum of three copies of H 3 (see also example 5.4).Therefore, we should observe equidistribution in a region of the shape given by [GHL15, Figure 11].The figure below illustrates this asymptotic behaviour.

Figure 1 :
Figure 1: Distribution of normalized Kloosterman sums modulo a prime and modulo a prime power.

Figure 2 :
Figure 2: Some hypocycloids (image extracted from the article [BCC + 16]) Theorem 1.6 ([DGL15, proof of Theorem 1.1] and [BCC + 16, Theorem 7 and p. 243,244]).Let d be a prime number.Then the sets of sums {S q (a, d); a ∈ Z/qZ} become equidistributed in H d with respect to the pushforward measure of the probability Haar measure on T d−1 via the map

Figure 5 :
Figure 5: The sets S q (−, d) for d = 3 and three 3-admissible values of q.
, b, 3) := x∈(Z/qZ) × x 3 =1 e Å ax 3 + bx q ã où a, b ∈ Z/qZHowever, this type of sum does not fall inside the range of application of Proposition B (b), because the exponent 3 in the polynomial expression ax 3 + bx is not coprime with the order of the subgroup.In fact, this situation is part of case (a) of Proposition B.Finally, let us illustrate Proposition 5.3, which gives a geometric interpretation of the image of g d when d is a prime power.If we take again the example of Kloosterman sums, Proposition B (b) states that the sums:K q (a, b, 9) = x∈(Z/qZ) × x 9 =1 e Å ax + bx −1 q ã , a, b ∈ Z/qZ