Intersective polynomials and Diophantine approximation. II (Q2342279)

Let \(h(x),h_i(x)\), be polynomials with integer coefficients, \(\theta, \theta_ k\) exponents, \(n,N,q,k\) positive integers, \(\alpha,\beta\) real numbers, \(A\) an \(l\times k\) matrix with real entries, and \(\|x\|\) denotes the distance of \(x\) to the nearest integer. \textit{I. M. Vinogradov} [Leningrad, Bull. Ac. Sc. (6) 20, 585--600 (1926; JFM 52.0182.03)] has proved that \(\min_{1\leq n \leq N}\|\alpha n^k\|\ll N^{-\theta_k}\). Many authors provided many generalizations, especially the second author [Int. Math. Res. Not. 2014, No. 5, 1153--1173 (2014; Zbl 1296.11092)] extended this result to \(\min_{1\leq p\leq N, p \text{ prime}}\|\alpha h(p)\|\ll N^{-\theta}\), assuming that for every \(q\) there is a coprime integer \(n\) such that \(h(n)\equiv0\pmod q\) (called intersective polynomial). In this paper, the authors give the extension \[ \min_{1\leq p\leq N, p\text{ prime }}\max_{1\leq i\leq l}\|v_i(p)\|\ll N^{-\theta}, \] where \[ A(h_1(n),\dots,h_k(n))^T=(v_1(n),\dots,v_l(n))^T \] and any linear combination of \(h_1(x),\dots,h_k(x)\) is intersective. The bound is uniform in \(N\) and \(A\). They give as an example \[ \min_{1\leq p\leq N, p\text{ prime }}\max(\|\alpha(p-1)^2\|,\|\beta(p-1)^3\|)\ll N^{-\theta}, \] uniformly in \(\alpha,\beta\) and \(N\). In the proof the authors reformulate the problem in the language of lattices.