The number of lattice points , as a function of the real variable is studied, where belongs to a special class of algebraic cross-polytopes and simplices. It is shown that the number of lattice points can be approximated by an explicitly given polynomial of t depending only on P. The error term is related to a simultaneous Diophantine approximation problem for algebraic numbers, as in Schmidt's theorem. The main ingredients of the proof are a Poisson summation formula for general algebraic polytopes, and a representation of the Fourier transform of the characteristic function of an arbitrary simplex in the form of a complex line integral
AbstractHilbert’s 17th Problem launched a number of inquiries into sum-of-squares representations of...
There are many results in the literature concerning power values, equal values or more generally, po...
There are many results in the literature concerning power values, equal values or more generally, po...
The discrepancy | t P ∩ Z^d | - lambda (P) t^d is studied as a function of the real variable t>1, wh...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: G...
AbstractThe main problem in (planar) lattice point theory consists in counting lattice points under ...
Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ ...
Abstract. For A ∈ Zm×n we investigate the behaviour of the number of lattice points in PA(b) = {x ∈...
AbstractThe old problem of counting lattice points in euclidean spheres leads to use Jacobi theta fu...
AbstractThe exact order of the remainder term is determined in the formula for the number of lattice...
AbstractPick's theorem about the area of a simple lattice planar polygon has many extensions and gen...
The Ehrhart polynomial ehrP(n) of a lattice polytope P gives the number of integer lattice points in...
AbstractPolynomial lattice point sets are polynomial versions of classical lattice point sets and am...
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice poi...
AbstractHilbert’s 17th Problem launched a number of inquiries into sum-of-squares representations of...
There are many results in the literature concerning power values, equal values or more generally, po...
There are many results in the literature concerning power values, equal values or more generally, po...
The discrepancy | t P ∩ Z^d | - lambda (P) t^d is studied as a function of the real variable t>1, wh...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: G...
AbstractThe main problem in (planar) lattice point theory consists in counting lattice points under ...
Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ ...
Abstract. For A ∈ Zm×n we investigate the behaviour of the number of lattice points in PA(b) = {x ∈...
AbstractThe old problem of counting lattice points in euclidean spheres leads to use Jacobi theta fu...
AbstractThe exact order of the remainder term is determined in the formula for the number of lattice...
AbstractPick's theorem about the area of a simple lattice planar polygon has many extensions and gen...
The Ehrhart polynomial ehrP(n) of a lattice polytope P gives the number of integer lattice points in...
AbstractPolynomial lattice point sets are polynomial versions of classical lattice point sets and am...
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice poi...
AbstractHilbert’s 17th Problem launched a number of inquiries into sum-of-squares representations of...
There are many results in the literature concerning power values, equal values or more generally, po...
There are many results in the literature concerning power values, equal values or more generally, po...