Lattice points in algebraic cross-polytopes and simplices
From MaRDI portal
(Redirected from Publication:724947)
Abstract: 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 depending only on . 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 1018569 (Why is no real title available?)
- Average decay of Fourier transforms and integer points in polyhedra
- Classical Fourier analysis
- Counting lattice points by means of the residue theorem
- Ergodic theory on \(SL(n)\), diophantine approximations and anomalies in the lattice point problem
- Intermediate sums on polyhedra: computation and real Ehrhart theory
- On integer points in polygons
- On the Number of Lattice Points in a Compact n-Dimensional Polyhedron
- Polynomials Associated with Finite Gell-Complexes
- Rational Ehrhart quasi-polynomials
- Simultaneous approximation to algebraic numbers by rationals
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- The Ehrhart polynomial of a lattice polytope
- The lattice point discrepancy of a torus in \(\mathbb R^3\)
- Toric varieties, lattice points and Dedekind sums
Cited in
(4)
This page was built for publication: Lattice points in algebraic cross-polytopes and simplices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724947)