Multiple exponential sums with monomials
For estimating multiple exponential sums with monomials \textit{E. Fouvry} and \textit{H. Iwaniec} [J. Number Theory 33, 311-333 (1989; Zbl 0687.10028)] were the first to use the double large sieve inequality due to E. Bombieri and H. Iwaniec. Let \(A\) denote the Weyl's step in van der Corput's theory of estimating exponential sums and \(D\) the process of applying the large sieve. Then they considered the iterated process \(AD\). Here a crucial point is the spacing problem for the points \[ t(m,q) = (m + q)^\alpha - (m - q)^\alpha. \] The authors consider the \(A^2D\)-process, which involves the spacing problem for the points \[ t(m,q_1,q_2) = t(m +q_2,q_1) - t(m - q_2,q_1). \] The method of E. Fouvry and H. Iwaniec is applied to consider the case \(q_1\) near to \(q_2\) on the one hand and the case \(q_2\) larger than \(q_1\) on the other hand. Some estimates for exponential sums with monomials are given.
- Exponential sums with monomials
- Some applications of the double large sieve
- A fourth derivative test for exponential sums
- Three-dimensional exponential sums with monomials
- CONSECUTIVE SQUARE-FREE NUMBERS OF THE FORM [nc], [nc] + 1
- Multiple exponential sums with monomials and their applications in number theory
- Distribution of cube-free numbers with form \([n^c]\)
This page was built for publication: Multiple exponential sums with monomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4486467)