Weyl sums over integers with affine digit restrictions (Q710481)

Let \(q\geq 2\) be a given integer and let \(n=\sum_{j=0}^L \varepsilon_j(n)q^j\) be the \(q\)-ary digital expansion of \(n\) with digitals \(\varepsilon_j(n)\in\{0,1,\ldots,q-1\}\), and \(L=L(n)=[\log_q n]\) denotes the length of the expansion of \(n\). Further, for \(\ell\in\{0,1,\ldots, q-1\}\) let \(|n|_{\ell}=\text{card}\{j\in \mathbb{N}: 0\leq j\leq L, \varepsilon_j(n)=\ell\}\). For any complete system \(\mathcal{L}=(L_k)_{k=1,\ldots, K}\) of linear forms over \(\mathbb{R}^q\), for any \(\mathcal{L}\)-admissible \(K\)-tuple \(\pmb{\eta}=(\eta_1,\ldots,\eta_K)\in(\mathbb{R}^+)^K\) and for any \(K\)-tuple \(\pmb{\mu}=(\mu_1,\ldots,\mu_K)\in\mathbb{Z}^K\) let \(\mathcal{N}=\mathcal{N}(\mathcal{L},\pmb{\eta},\pmb{\mu})= \{n\in\mathbb{N}: L_k(|n|_0, |n|_1,\ldots,|n|_{q-1})=[\eta_k\log_qn]+\eta_k, k=1,\ldots,K\}\). The authors prove that for any irrational number \(\alpha\) the sequence \((n\alpha)_{n\in \mathcal{N}}\) is uniformly distributed modulo~1. It follows from Weyl's criterion that in order to prove this main result it is enough to show that \(\sum_{n\in\mathcal{N},n\leq N}e(\alpha n)=o(\text{card}\{n\in\mathcal{N}: n\leq N\})\). For this purpose the authors use a specific saddle point method applied to properly chosen generating functions.