Skip to main content
Notice removed Draw attention by CommunityBot
Bounty Ended with no winning answer by CommunityBot
Notice added Draw attention by Frank Thorne
Bounty Started worth 50 reputation by Frank Thorne
Source Link
Frank Thorne
  • 7.4k
  • 10
  • 65
  • 82

Counting lattice points inside a three-dimensional ellipsoid

I want to answer the following simple question:

Given a three-dimensional ellipsoid defined by $Q(x, y, z) \leq Z$ for a positive definite quadratic form $Q$, how many lattice points in $\mathbb{Z}^3$ are inside the ellipsoid?

The answer is given by the volume of the ellipsoid (of order $Z^{3/2}$) plus an error term, and I am interested in the strongest possible error term, which I hope would be $O(Z^{3/4})$ or better. The error term should also depend on $Q$ in some fashion which is explicitly described.

It seems like this question must have been extensively studied by now. But I was unable to find a suitable reference. Two references that approach what I'm looking for are:

  1. Schmidt (Lemma 1, Northcott's theorem on Heights II. The quadratic case, Acta Arith., 1995) proves that if $S$ is (for example) a convex body in $n$ dimensions, lying in a ball of radius $r$, and $\Lambda$ is any lattice of rank $r$, the number of lattice points of $\Lambda$ inside $S$ is $$\frac{\rm{Vol}(S)}{\det(\Lambda)} + O\left(\frac{\lambda_n r^{n - 1}}{\det(\Lambda)}\right),$$ where $\lambda_n$ is the largest successive minimum of $\Lambda$. After a change of variable this is equivalent to my question, and the answer is of the form I am looking for -- but I believe a better error term should be possible when $S$ is an ellipsoid.

  2. Bentkus and Götze (main theorem, On the lattice point problem for ellipsoids, Acta Arith., 1997) formulate the question in the same way that I did, and obtain a power savings of $Z$ in the error term (as opposed to $Z^{1/2}$, which is what can be deduced from Schmidt's paper or any similar geometry of numbers method). Writing the quadratic form as $\langle Qx, x \rangle$, the theorem specificies the dependence of the error term on the eigenvalues of $Q$. This is of the shape that I'm interested in, but the paper requires that the dimension be at least 9.

I skimmed through the likelier looking references in the latter paper, as well as the books on counting lattice points of Krätzel and Fricker, and I found nothing. The problem of counting lattice points in three-dimensional ellipsoids is addressed, but if the dependence of the error term on the ellipsoid is made explicit, then I missed it.

Finally I should mention that I know how to solve my own problem: write down the Epstein zeta function associated to $Q$, and estimate its partial sums using Perron's formula and the method of Landau and Chandrasekharan-Narasimhan. (The methods in the books above don't use Epstein zeta functions, but after a brief reading they seem like equivalent arguments that don't go through the usual zeta function machinery.) The dependence of the error term on $Q$ can be described in terms of the functional equation for the Epstein zeta function.

But I would prefer to avoid inventing the wheel if I can help it. Does anyone know if such a theorem has already been proved? Thank you very much.