Random Diophantine inequalities of additive type (Q411630): Difference between revisions

Let \(k,s\in\mathbb{N}\), \(s\geq 2\), \(\tau >0\), \(\vec{\lambda}=(\lambda_{1}, \ldots,\lambda_{s})\in \Lambda^{(s)}=(\mathbb{R}-\{0\})^{s}\). The authors are interested in finding an asymptotic formula for the density of integer solutions for the inequality \[ |\lambda_{1}x_{1}^{k} + \lambda_{2}x_{2}^{k} + \cdots + \lambda_{s}x_{s}^{k}| < \tau . \tag{1} \] Denote by \(N_{\lambda}^{(k)}\) the number of integer solutions of (1) in the box \(|\vec{x}| \leq P\), \(\vec{x}=(x_{1},x_{2}, \dots, x_{s})\in (\mathbb{Z})^{s}\), and define \[ \Lambda_{k}^{(s)} = \begin{cases} \Lambda^{(s)}, & \text{if \(k\) is odd} \\ \{ \vec{\lambda}\in\Lambda^{(s)} : \lambda_{i}\lambda_{j} < 0 \;\; \text{for some} \;\; 1\leq i,j\leq s\}, & \text{if \(k\) is even}. \end{cases} \] The main result of the paper is: Let \(k\geq 2, s>2k\) and \(\delta = 8^{-2k}\). Then for almost all \(\vec{\lambda}\in\Lambda^{(s)}_{k}\), there exist a number \(P_{0}=P_{0}(\vec{\lambda},k)\), and a positive real number \(J_{k,s}(\vec{\lambda})\) such that the inequality \[ |N_{\lambda}^{(k)} - 2\tau J_{k,s}(\vec{\lambda})P^{s-k}| < P^{s-k -\delta} \] holds for all \(P\geq P_{0}\), uniformly in \(0< \tau \leq 1\). The proof uses the Davenport-Heilbronn circle method.