SearcharxivSearch

arXiv subjects

Ph. Michel

Publications and source records attributed to Ph. Michel.

5 recordsLinked to original sources

Stratification and averaging for exponential sums: bilinear forms with generalized Kloosterman sums

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which matches Burgess's range, is identical with the best results previously known only for simpler exponentials of monomials. The proof combines refinements of the analytic tools from our previous paper and new geometric methods. The key geometric idea is a comparison statement that shows that even when the "sum-product" sheaves that appear in the analysis fail to be irreducible, their decomposition reflects that of the "input" sheaves, except for parameters in a high-codimension subset. This property is proved by a subtle interplay between \'etale cohomology in its algebraic and diophantine incarnations. We prove a first application concerning the first moment of a family of $L$-functions of degree $3$.

math.NT

Bilinear forms with Kloosterman sums and applications

We prove non-trivial bounds for general bilinear forms in hyper-Kloosterman sums when the sizes of both variables may be below the Pólya-Vinogradov range. We then derive applications to the second moment of holomorphic cusp forms twisted by characters modulo primes, and to the distribution in arithmetic progressions to large moduli of certain Eisenstein-Hecke coefficients on $\GL_3$. Our main tools are new bounds for certain complete sums in three variables over finite fields, proved using methods from algebraic geometry, especially $\ell$-adic cohomology and the Riemann Hypothesis.

math.NT

On short sums of trace functions

We consider sums of oscillating functions on intervals in cyclic groups of size close to the square root of the size of the group. We first prove non-trivial estimates for intervals of length slightly larger than this square root (bridging the "Polyá-Vinogradov gap" in some sense) for bounded functions with bounded Fourier transforms. We then prove that the existence of non-trivial estimates for ranges slightly below the square-root bound is stable under the discrete Fourier transform, and we give applications related to trace functions over finite fields.

math.NT

The sliding-sum method for short exponential sums

We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are barely insufficient to obtain non-trivial results. In particular, we prove various estimates for exponential sums over intervals in finite fields and related sums just below the Polya-Vinogradov range, and derive applications to equidistribution problems.

math.NT

A study in sums of products

We give a general version of cancellation in exponential sums that arise as sums of products of trace functions satisfying a suitable independence condition related to the Goursat-Kolchin-Ribet criterion, in a form that is easily applicable in analytic number theory.

math.NT