On the \(k\)-th mean values of class numbers of primitive binary quadratic forms of negative discriminant (Q2548624): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q203609 |
Changed an Item |
||
Property / author | |||
Property / author: Richard Warlimont / rank | |||
Normal rank |
Revision as of 23:48, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the \(k\)-th mean values of class numbers of primitive binary quadratic forms of negative discriminant |
scientific article |
Statements
On the \(k\)-th mean values of class numbers of primitive binary quadratic forms of negative discriminant (English)
0 references
1971
0 references
Let \(h(-n)\) be the number of classes of primitive quadratic forms with negative discriminant \(-n\). By the known class number formula the asymptotic evaluation of the sum \(\sum_{n\leq x} h^k(-n)\) reduces to the estimation of the remainder term \(\Delta_k(x)\) in the expansion \[ \sum_{n\leq x} L^k(1,\chi_n) =x \cdot r(k) +\Delta_k(x), \] where the character \(\chi_n(m)=\left(-n\over m\right)\) is the Jacobi symbol. In the case \(k>1\), \textit{D. Wolke} [J. Number Theory 1, 502--511 (1969; Zbl 0184.07403)] improved results of A. F. Lavrik, O. Saparniyazov, M. B. Barban and G. Gordover, using the recent version of the ``large sieve''. In the paper under review the author is able to improve the estimations of D. Wolke. His proof is similar to that of Wolke, though somewhat more transparent. Of special interest is the fact that the central ``Hilfssatz 1'' is proved without using the large sieve inequality. The author states that for \(k\geq 4\) his results would also follow from Wolke's proof by a more appropriate choice of parameters. It should be mentioned here, that recently \textit{D. Wolke} [Arch. Math. 22, 65--69 (1971; Zbl 0221.12011)] improved Warlimont's estimations for large \(k\) combining his proof with the method of Halász-Montgomery.
0 references