On logarithmically small errors in the lattice point problem
Let \(O\subset\mathbb{R}^n\) be a compact region of volume Vol \(O\) and \(\Gamma\subset\mathbb{R}^n\) be a lattice of determinant \(\det\Gamma\). The problem of calculating the number of lattice points in a dilating domain by evaluating the remainder \(R(tO,\Gamma)\) as \(t\to\infty\) is a classical lattice point problem. In a series of papers by the first author it was shown that in arbitrary dimensions there exist regions and lattices with logarithmically small errors. It was also shown that such anomalies in the lattice point problem are intimately related with diophantine and ergodic properties of certain flows on homogeneous spaces of the group SL\((n,\mathbb{R})\). In the present paper an improvement of a previous result of \textit{M. M. Skriganov} [Invent. Math. 132, 1-72 (1998; Zbl 0902.11041)] on logarithmically small errors in the lattice point problem for polyhedra is given. This improvement is based on an analysis of hidden symmetries of the problem generated by the Weyl group for SL\((n,\mathbb{R})\). Let \(UP\) denote a rotation of a given compact polyhedron \(P\subset\mathbb{R}^n\) by an orthogonal matrix \(U\in\text{SO}(n)\), \(tUP\) a dilation of \(UP\) by a parameter \(t>0\) and \(N(tUP)\) the number of integer points in \(\mathbb{Z}^n\) which fall into the polyhedron \(tUP\). It is shown here that for almost all rotations \(U\) in the sense of the Haar measure on SO\((n)\), the asymptotic formula \[ N(tUP)=t^n\text{Vol} P+{\mathcal O}\bigl((\log t)^{n-1+ \varepsilon}\bigr),\quad t\to \infty \] holds with arbitrary small \(\varepsilon>0\).
- Ergodic theory on \(SL(n)\), diophantine approximations and anomalies in the lattice point problem
- Lattice points in rotated convex domains
- Ergodic theory on homogeneous spaces and the calculation of lattice points in polyhedrons
- Hardy-type results on the average of the lattice point error term over long intervals
- On integer points in polygons
- Ergodic theory on \(SL(n)\), diophantine approximations and anomalies in the lattice point problem
- Distribution of the error in estimated numbers of fixed points of the discrete logarithm
- On integer points in polygons
- Ergodic theory on homogeneous spaces and the calculation of lattice points in polyhedrons
- On low discrepancy sequences and low discrepancy ergodic transformations of the multidimensional unit cube
This page was built for publication: On logarithmically small errors in the lattice point problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520560)