Skip to main content
Log in

Counting Lattice Points by Means of the Residue Theorem

  • Published:
The Ramanujan Journal Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We use the residue theorem to derive an expression for the number of lattice points in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart polynomial. We show that it is a polynomial in t, where t is the integral dilation parameter. We prove the Ehrhart-Macdonald reciprocity law for these tetrahedra, relating the Ehrhart polynomials of the interior and the closure of the tetrahedra. To illustrate our method, we compute the Ehrhart coefficient for codimension 2. Finally, we show how our ideas can be used to compute the Ehrhart polynomial for an arbitrary convex lattice polytope.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A.I. Barvinok, “Computing the Ehrhart polynomial of a convex lattice polytope,” Discrete Comput. Geom. 12 (1994) 35–48.

    Google Scholar 

  2. M. Beck, “The reciprocity law for Dedekind sums via the constant Ehrhart coefficient,” Amer. Math. Monthly 106(5) (1999) 459–462.

    Google Scholar 

  3. M. Beck, R. Diaz, and S. Robins, “The Frobenius problem, rational polytopes, and Fourier-Dedekind sums,” Preprint, submitted.

  4. M. Brion and M. Vergne, “Residue formulae, vector partition functions and lattice points in rational polytopes,” J. Amer. Math. Soc. 10(4) (1997) 797–833.

    Google Scholar 

  5. R. Diaz and S. Robins, “The Erhart polynomial of a lattice polytope,” Annals of Math. 145 (1997) 503–518.

    Google Scholar 

  6. E. Ehrhart, “Sur un problème de géométrie diophantienne linéaire II,” J. reine angewandte Math. 227 (1967) 25–49.

    Google Scholar 

  7. J.M. Kantor and A.G. Khovanskii, “Une application du Théorème de Riemann-Roch combinatoire au polynôme d'Ehrhart des polytopes entier de ℝn,” C.R. Acad. Sci. Paris, Series I 317 (1993) 501–507.

    Google Scholar 

  8. A.G. Khovanskii and A.V. Pukhlikov, “The Riemann-Roch theorem for integrals and sums of quasipolynomials on virtual polytopes,” St. Petersburg Math. J. 4(4) (1993) 789–812.

    Google Scholar 

  9. I.G. MacDonald, “Polynomials associated with finite cell complexes,” J. London Math. Soc. 4 (1971) 181–192.

    Google Scholar 

  10. P. McMullen, “Lattice invariant valuations on rational polytopes,” Arch. Math. (Basel) 31(5) (1978/1979) 509–516.

    Google Scholar 

  11. J. Pommersheim, “Toric varieties, lattice points, and Dedekind sums,” Math. Ann. 295 (1993) 1–24.

    Google Scholar 

  12. H. Rademacher and E. Grosswald, “Dedekind sums,” Carus Mathematical Monographs, The Mathematical Association of America, 1972.

  13. R. Stanley, Enumerative Combinatorics, Wadsworth and Brooks/Cole, Monterey, CA, 1986.

    Google Scholar 

  14. D. Zagier, “Higher dimensional Dedekind sums,” Math. Ann. 202 (1973) 149–172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beck, M. Counting Lattice Points by Means of the Residue Theorem. The Ramanujan Journal 4, 299–310 (2000). https://doi.org/10.1023/A:1009853104418

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009853104418

Navigation