Integer points in a domain with smooth boundary
the number of squares whose centre lies within Ω or on its boundary C, or
the number of vertices of the square lattice which lie within Ω or on C, or
the number of squares which lie wholly within Ω plus half the number of squares cut by C.
Unable to display preview. Download preview PDF.
- M. Branton and P. Sargos. — Points entiers au voisinage d’une courbe plane à très faible courbure,to appear.Google Scholar
- S.W. Graham and G. Kolesnik. — Van der Corput’s Method for Exponential Sums,London Math. Soc. Lecture Notes, to appear.Google Scholar
- M.N. Hurley. — Exponential sums and rounding error, J. London Math. Soc., to appear.Google Scholar
- M.N. Huxley. — A note on short exponential sums,to appear.Google Scholar
- E. Kratzel. — Lattice Points, D.V.W., Berlin, 1988.Google Scholar
- W. Moller and G. Nowak. — Lattice points in planar domains applications of Huxley’s “discrete Hardy-Littlewood method” in Number-Theoretic Analysis III, Springer Lecture Notes in Math., to appear.Google Scholar