An analog of van der Corput's A4-process for exponential sums

From MaRDI portal
Publication:4429656





Let \(M\) be a large positive integer and \(\lambda_k\) be a small positive real number (say \(0 < \lambda_k < 1/10)\). Let \(f:[1,M]\to {\mathbb R}\) be a \(C^k\) function that satisfies van der Corput hypothesis \(\lambda_k \leq f^{(k)} (x) \ll \lambda\) for \(1\leq x \leq M\). Let \(S=\sum_{m=1}^M e(f(m))\). The classical van der Corput method [see \textit{S.W. Graham} and \textit{G. Kolesnik}, Van der Corput's method of exponential sums, London Math. Soc. Lect. Note Ser. 126, Cambridge University Press (1991; Zbl 0713.11001)] uses two processes, generally denoted \(A\) and \(B\), to obtain upper bounds for \(S\). For example, by applying \(A^{k-2}B\); i.e., iterating the \(A\) process \(k-2\) times, then applying \(B\), one obtains \(S \ll M \lambda_k^{1/(2^k-2)}\) whenever \(M \gg \lambda_k^{-2^{k-2}/(2^{k-1}-1)}\). In this paper, the author develops an alternative process that can be advantageously substituted for \(A^4\) in some circumstances. He refers to this process as \(A_4\). For \(k\geq 6\), one may replace \(A_{k-2}B\) with \(A_4 A^{k-6}B\). The latter application leads to better results for \(k\geq 7\), and the improvements become more pronounced for \(k\geq 9\). For example, the process \(A_4 A^3 B\) gives \(S\ll_{\epsilon} M^{1+\epsilon} \lambda_9^{1/420}\) for \(M\gg \lambda_9^{-48/105}\), while van der Corput's \(A^7 B\) gives \(S\ll M\lambda_9^{1/510}\) for \(M \gg \lambda_9^{-128/255}\). The author also shows that the \(A_4\) process can be integrated into the theory of exponent pairs.











This page was built for publication: An analog of van der Corput's A4-process for exponential sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429656)