scientific article; zbMATH DE number 1018569
Let \({\mathbb P}\) be a compact convex polyhedron in \({\mathbb R}^k\), with \((k-1)\)-dimensional faces \(F_1,\dots,F_m\) and corresponding exterior normal vectors \({\mathbf n}_1,\dots,{\mathbf n}_m\). The author is interested in the number \(N(t)\) of (integral) lattice points in the dilated (blown up) polyhedron \(t {\mathbb P}\), \(t\) a large real parameter. Under the assumption that each \({\mathbf n}_j\) has at least two components whose ratio is an irrational algebraic number, he shows that, for any \(\epsilon>0\), \[ N(t) = \text{ vol}({\mathbb P})t^k + O(t^{k-2+\epsilon}). \] The proof is based on counting lattice points by Poisson's formula (using a suitable smoothing technique) and a repeated application of the divergence theorem. It finally rests on \textit{K. F. Roth}'s celebrated result [Mathematika 2, 1-20 (1955; Zbl 0064.28501)] on the approximability of rationals by algebraic numbers.
- Counting lattice points by means of the residue theorem
- Bounded error uniformity of the linear flow on the torus
- A relation between number of integral points, volumes of faces and degree of the discriminant of smooth lattice polytopes
- The number of lattice points in alcoves and the exponents of the finite Weyl groups
- Lipschitz2 : A New Version of an Old Principle
- Lattice points in vector-dilated algebraic polytopes
- On integer points in polygons
- On integer points in polygons
- On the distribution of the power of integers of a complex cubic number field
- On the integer points in a lattice polytope: \(n\)-fold Minkowski sum and boundary
- Lattice points in algebraic cross-polytopes and simplices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339405)
