Lattice points in planar convex domains (Q706199)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lattice points in planar convex domains
scientific article

    Statements

    Lattice points in planar convex domains (English)
    0 references
    0 references
    7 February 2005
    0 references
    The author investigates the number of lattice points in (precisely defined) planar convex domains. The aim is to give precise, explicit numerical estimates for the remainder terms in certain asymptotic formulas. For example, let a general planar convex domain \(CD_2\) contain the origin in its interior whose boundary is twice differentiable. Let \(F(t_1,t_2; CD_2)\) denote the distance function of \(CD_2\), and let the number of lattice points be \[ A(x; CD_2) = \sharp\Big\{\,(m,n)\in\mathbb Z^2\;:\;F(m,n; CD_2) \leq x\,\Bigr\}. \] Then \(A(x; CD_2) = x^2{\text{ area}}(CD_2) + \rho(x)\), say. The author proves the explicit estimate \[ | \rho(x)| \leq 48(r_{\text{ max}}x)^{2/3} + \left(703\sqrt{r_{\text{ max}}} + {3r_{\text{ max}}}\over5r_{\text{ min}}\right)\sqrt{x} + 11 \] for the remainder function \(\rho(x)\), where \(r_{\text{ max}}\) and \(r_{\text{ min}}\) denote the maximum and (resp.) the minimum of the absolute value of the radius of curvature of the boundary. Two other sharp, explicit results of a similar nature are also proved.
    0 references
    0 references
    lattice points
    0 references
    planar convex domains
    0 references
    superellipses
    0 references
    0 references