scientific article; zbMATH DE number 1305367

From MaRDI portal
Publication:4252245





\textit{H. Iwaniec} [Acta Arith. 37, 307-320 (1980; Zbl 0444.10038)] proved a version of the Rosser sieve with a bilinear form of the remainder term. The extra flexibility of this form of the remainder term has proved to be very useful in applications. In this paper, the author shows how a bilinear form of the remainder term can be incorporated into the Selberg \(\Lambda^2\)-sieve. In the version given here, the error term in the upper bound for \(S({\mathcal A},z)\) is \(( \log z) \sup_{\alpha,\beta} \left|\sum^* \alpha_m \beta_n R_{mn}\right|\). Here, \(\sum^*\) denotes that the sum is over \(m\leq y, n\leq y, (m,n)=1\), and the supremum is taken over all complex vectors \(\alpha,\beta\) such that \(|\alpha_m|\leq 1, |\beta_n|\leq 1\). The other notation is standard in sieve methods; see, for example, \textit{H. Halberstam} and \textit{H.-E. Richert} [Sieve Methods, London Mathematical Society Monographs 4. Academic Press, New York (1974; Zbl 0298.10026)]. Motohashi's version of the remainder term has two drawbacks when compared to Iwaniec's version: the condition \((m,n)=1\) is imposed, and \(m\) and \(n\) have the same upper bound. Nonetheless, the author remarks that his result yields the Brun-Titchmarsh bound \[ \pi(x,q,l) \leq (2+o(1)) x/\log(xq^{-3/8})\quad{\text for}\quad q \leq x^{9/20-\epsilon}, \] and this precisely is what is obtainable by Iwaniec's linear sieve. For the entire collection see [Zbl 0911.00018].











This page was built for publication:

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