Counting lattice points and O-minimal structures (Q2927901)

The authors introduce a wide class of sets (definable sets) such that the number of lattice points in these sets admits a sharp estimate.NEWLINENEWLINEMore precisely, let \(\Lambda\) be a lattice in \(\mathbb{R}^n\), and \(Z\subseteq\mathbb{R}^{n+m}\) be a definable set. Suppose that the fibers \(Z_T=\{x\in\mathbb{R}^n:(T,x)\in Z\}\) are bounded. Then the exists a constant \(c_Z\), depending only on \(Z\), such that NEWLINE\[NEWLINE\left| |Z_T\cap\Lambda|-\frac{Vol(Z_T)}{\det \Lambda}\right| \leq c_Z \sum_{j=0}^{n-1} \frac{V_j(Z_T)}{\lambda_1\dots\lambda_j} .NEWLINE\]NEWLINE Here \(\lambda_j\) is the \(j\)-th successive minima of \(\Lambda\) with respect to the zero-centered unit ball and \(V_j(Z_T)\) is the sum of the \(j\)-dimensional volumes of the orthogonal projections of \(Z_T\) on every \(j\)-dimensional coordinate subspace of \(\mathbb{R}^n\).NEWLINENEWLINEThe definition of the definable set is quite complicate and based on the concept of O-minimal structure from model theory. But it is shown that many ``good'' sets are definable. For example, every semialgebraic set has this property.