No label defined (Q3720680)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3950641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3950641 |
Statements
1985
0 references
numbers with restricted prime factors
0 references
weighted sieve
0 references
bilinear form
0 references
error term
0 references
short intervals
0 references
exponent pairs
0 references
0.8700628280639648
0 references
0.8288145065307617
0 references
0.8288145065307617
0 references
[For the entire collection see Zbl 0583.00004.] In the second paper of this series (see the preceding review of part I) the authors combine the mechanism of the weighted sieve with the bilinear form of the error term introduced by \textit{H. Iwaniec} [Acta Arith. 36, 171-202 (1980; Zbl 0435.10029)], though their exposition is in the style of \textit{Y. Motohashi}'s account [Lectures on sieve methods and prime number theory (Lect. Math. Phys. 72) (1983; Zbl 0535.10001)]. The error term in question, initially of the shape \[ \sum_{d| P(z)}\mu (d) \chi^-_ y(d)(1-\sum_{p| d}\{1-w(p)\})R_ d \] is given a ''bilinear'' form \(\sum_{m<M,n<N,mn| P(z)}a_ m b_ n R_{mn}\), where \(| a_ m| \leq 1\), \(| b_ n| \leq 1\), \(MN=y\), \(M>z\), \(N>1\). The condition \(mn | P(z),\) where P(z) is the squarefree product of primes not exceeding z, is the natural one, since d was supported on squarefrees. It does however appear that for some applications it would be more convenient if some extraneous non- squarefree products mn were introduced (together with concomitant error terms) so that the condition were replaced by m \(| P(z)\), n \(| P(z)\) in Iwaniec's style. The authors illustrate their work with an application to the problem of guaranteeing the existence of \(P_ R\) numbers (with at most R prime factors) in short intervals \((x-x^{\theta},x)\). Together with numerical work based on exponent pairs their results indicate that (for large x) \(P_ R\) numbers can be found as required if \(\theta =\theta_ R\) for certain \(\theta_ R\) which satisfy \[ \theta_ 2\leq 0.4545,\quad \theta_ 3\leq 0.3257<1/3,\quad \theta_ 4\leq 0.2496<1/4. \] The result for \(\theta_ 2\) is not an improvement on the result of \textit{H. Iwaniec} and \textit{M. Laborde} [Ann. Inst. Fourier. 31, No.4, 37-56 (1981; Zbl 0472.10048)], but by combining their methods with those of Iwaniec and Laborde the authors indicate they could obtain \(\theta_ 2\leq 0.4476.\)
0 references