The large sieve inequality for integer polynomial amplitudes

From MaRDI portal



Abstract: We obtain a close to the best possible version of the large sieve inequality with amplitudes given by the values of a polynomial with integer coefficients of degree geq2.


Let \(Q,k\geq 1\) be integers, \(I\) an interval in \({\mathbb Z}\) of length \(N\), \({\mathcal F}(Q)\) the Farey sequence of order \(Q\), \(P(T)=c_0T^k+c_1T^{k-1}+\ldots+c_k\in{\mathbb Z}[T]\) a polynomial of degree \(k\). The authors prove \[ \sum_{x\in {\mathcal F}(Q)} \left|\sum_{j\in I}a_je^{2\pi i xP(j)}\right|^2\ll Q(N+Q)(\log 2Q)^{\omega(c_0)+k\binom{k+1}{2}}\parallel a\parallel^2 \] for every sequence of complex numbers \(\{a_j\}_{j\in I}\), where \(\omega(c_0)\) is the number of prime divisors of \(c_0\) and the implicit constant in \(\ll\) depends only on \(k\).











This page was built for publication: The large sieve inequality for integer polynomial amplitudes

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