No label defined (Q3824487)
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 4097499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4097499 |
Statements
1990
0 references
multiplicative functions on arithmetic progressions
0 references
large moduli
0 references
analogues of Bombieri-Vinogradov theorem
0 references
Dirichlet series
0 references
character
0 references
large sieve
0 references
0.8866147398948669
0 references
0.8761164546012878
0 references
0.8707060813903809
0 references
0.8667421340942383
0 references
0.8661807775497437
0 references
Let \(g\) be a complex-valued multiplicative arithmetic function assumed only to satisfy \(| g(n)| \leq 1\) on the positive integers \(n\). For integers \(r,D>0\) and real \(x\geq 2\), let \[ E(x,D,r)=\sum_{\substack{n\leq x \\ n\equiv r\pmod D}} g(n) - (1/\phi (D))\sum_{\substack{n\leq x \\ (n,D)=1}} g(n),\quad (n,D)=1. \] It is proved that for each fixed \(\delta\), \(0<\delta <1/2\), \[ \sum_{(\log x)^4 < p\leq x^{\delta}}(p-1) \max_{(r,p)=1} \max_{y\leq x} | E(y,p,r)|^2 \ll \frac{x^2(\log \log x)^4}{(\log x)^2}, \] \(p\) denoting a prime number. For the range of moduli \((\log x)^4<p\leq x^{\delta}\) this much improves the similar result in the author's previous paper II in this series [Mathematika 35, No. 1, 38--50 (1988; Zbl 0653.10042)]. A motivation in terms of functional analysis is given which suggests that apart from the factor \((log \log x)^4\) the upper bound cannot be improved. The above theorem is deduced from a more complicated Main Lemma involving primitive characters to composite moduli, and structured to throw into relief the obstruction to improved versions of the theorem. Instead of applying the method of high moments as in II, the author treats directly the Dirichlet series \(\sum g(n)\chi (n)n^{-s}\) with a character \(\chi\), in the style of \textit{P. X. Gallagher}'s proof of the well-known Bombieri-Vinogradov theorem [Mathematika 15, 1--6 (1968; Zbl 0174.08103)]. As in II both maximal versions of the large sieve and versions involving prime variables are employed. [Parts IV and V have meanwhile been published in J. Lond. Math. Soc., II. Ser. 41, No. 2, 201--216 (1990; Zbl 0671.10044); ibid. 41, No. 3, 408--424 (1990; Zbl 0671.10045).] [For the entire collection see Zbl 0706.00007.]
0 references