On the circle problem with polynomial weight (Q2702802)

From MaRDI portal





scientific article
Language Label Description Also known as
English
On the circle problem with polynomial weight
scientific article

    Statements

    13 March 2001
    0 references
    lattice points
    0 references
    circle problem
    0 references
    weight
    0 references
    0 references
    On the circle problem with polynomial weight (English)
    0 references
    The author discusses the circle problem concerning the number of lattice points \((x,y)\) within a circle with center \((a,b)\) and radius \(r\), where each \((x,y)\) being counted with polynomial \(p(x,y)\). This is easily estimated by \(\iint_{(x-a)^2+(y-b)^2\leq r} p(x,y) dx dy\) and the author describes the asymptotic behaviour of the error term in the form NEWLINE\[NEWLINE d^22^dh\Bigl ( O\bigl ((1+|a|^d)r^{\frac {46}{73}}(\log r)^\frac {315}{146}\bigr) +O\bigl (|a|^{d-1}r^{\frac {5}{3}}\bigr)+O\bigl (r^{d+\frac {2}{3}}\bigr) \Bigr), NEWLINE\]NEWLINE where \(d\) is the degree and \(h\) the height of the polynomial \(p\) and assuming (without loss of generality) \(|a|\geq |b|\). He applies this result to \(k\)th moments of the arithmetic function \(r(n)\), the number of distinct integer representations of \(n\) as \(n=x^2+y^2\), and he gives NEWLINE\[NEWLINE\sum_{1\leq n\leq t}n^kr(n)=\frac {\pi }{1+k}t^{1+k} +O\bigl (t^{k+\frac {1}{3}}\bigr)\text{ for }k=1,2,\dots.NEWLINE\]NEWLINE The proof is based on the asymptotic estimate \( r^2\pi +O\big (r^{\frac {46}{73}}(\log r)^{\frac {315}{146}}\big) \) for the classical Gauss circle problem given by \textit{M. N. Huxley} [Proc. Lond. Math. Soc. (3) 66, 279-301 (1993; Zbl 0820.11060)].
    0 references
    0 references

    Identifiers