A closer look at lattice points in rational simplices

zbMATH Open0934.11048arXivmath/0306034MaRDI QIDQ1307019FDOQ1307019

Authors: Matthias Beck 

Publication date: 16 January 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces, which determine the facets of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We give an elementary proof that the lattice point counts in the interior and closure of such a "vector-dilated" simplex are quasipolynomials satisfying an Ehrhart-type reciprocity law. This generalizes the classical reciprocity law for rational polytopes. As an example, we derive a lattice point count formula for a rectangular rational triangle, which enables us to compute the number of lattice points inside any rational polygon.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Counting lattice points of rational polyhedra
• Multidimensional Ehrhart reciprocity
• Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums

zbMATH Keywords

simplexlattice point\(n\)-dimensional polytopesquasipolynomials

Mathematics Subject Classification ID

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

Cited In (16)

• Lattice Simplices with a Fixed Positive Number of Interior Lattice Points: A Nearly Optimal Volume Bound
• Counting lattice points of rational polyhedra
• Lattice point simplices
• Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums
• Counting lattice points by means of the residue theorem
• On the number of points in a lattice polytope
• On the GLY conjecture of upper estimate of positive integral points in real right-angled simplices
• Counting lattice points in certain rational polytopes and generalized Dedekind sums
• The many aspects of counting lattice points in polytopes
• Multidimensional Ehrhart reciprocity
• Lattice points counting via Einstein metrics
• Integer hulls of linear polyhedra and scl in families
• Lonely points in simplices
• Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds
• Polynomial values of surface point counting polynomials
• Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups

This page was built for publication: A closer look at lattice points in rational simplices

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