Counting lattice points by means of the residue theorem

DOI10.1023/A:1009853104418MaRDI QIDQ1840495zbMATH OpenOpenAlexFDO

Authors Matthias Beck

Publication date 12 July 2001

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0306035

zbMATH Keywords

dilationEhrhart polynomialexact enumeration problemsgenerating functionslattice points in polytopes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice points in specified regions (11P21) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Abstract: We use the residue theorem to derive an expression for the number of lattice oints 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.

Review text

Let \(a_1,a_2,\dots, a_n\) be integer numbers greater than or equal to 2. An \(n\)-dimensional open tetrahedron \(P\) may be defined by \[ \sum_{k=1}^n \frac{x_k}{a_k}< 1, \] where \(a_k\) are positive real numbers. The number of lattice points in the dilated domain \(tP\), where \(t\) is a natural number, can be expressed by a polynomial in \(t\) of degree \(n\). The author constructs an analytical function such that this polynomial can be found by the residue theorem with respect to this function.

Recommendations

• Counting lattice points of rational polyhedra
• scientific article; zbMATH DE number 1018569
• Counting the Number of Integral Points in General n-Dimensional Tetrahedra and Bernoulli Polynomials
• scientific article; zbMATH DE number 2084974
• A closer look at lattice points in rational simplices

Cited in

(22)

• The Ehrhart polynomial of the Birkhoff polytope
• On the mean square of the remainder for the Euclidean lattice point counting problem
• Counting lattice points in certain rational polytopes and generalized Dedekind sums
• The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
• Polyhedral circuits and their applications
• Effective counting for discrete lattice orbits in the plane via Eisenstein series
• On the error term of a lattice counting problem
• Pseudomoments of the Riemann zeta-function and pseudomagic squares
• The many aspects of counting lattice points in polytopes
• Effective lattice point counting in rational convex polytopes
• scientific article; zbMATH DE number 3849350 (Why is no real title available?)
• scientific article; zbMATH DE number 3979163 (Why is no real title available?)
• Computing Optimized Path Integrals for Knapsack Feasibility
• Counting integral points in polytopes via numerical analysis of contour integration
• Counting components of an integral lamination
• Counting Finite Residuated Lattices
• An integral formula for the number of lattice points in a domain
• A new and faster representation for counting integer points in parametric polyhedra
• Counting points with Riemann-Roch formulas
• Lattice points in algebraic cross-polytopes and simplices
• A conical approach to Laurent expansions for multivariate meromorphic germs with linear poles
• On the GLY conjecture of upper estimate of positive integral points in real right-angled simplices

This page was built for publication: Counting lattice points by means of the residue theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840495)