The complex sum of digits function and primes (Q5939701)

From MaRDI portal
scientific article; zbMATH DE number 1626603
Language Label Description Also known as
English
The complex sum of digits function and primes
scientific article; zbMATH DE number 1626603

    Statements

    The complex sum of digits function and primes (English)
    0 references
    30 July 2001
    0 references
    Let \(\mathbb{Z}[i]\) denote the ring of Gaussian integers. For \(b \in \mathbb{Z}[i]\) and \({\mathcal N}=\{0,\dots, N(b)-1\}\) the pair is called a canonical number system if any \(\gamma \in \mathbb{Z}[i]\) admits a representation of the form \(\gamma = c_0+c_1b + \dots +c_hb^h\) with \(c_j \in {\mathcal N}\) and \(c_h\not= 0\) for \(h\not= 0\). Denote by \(p_b(x)\) the minimal polynomial of \(b\) and by \(\nu_b(\gamma)\) the sum of digits functions, i.e. \(\nu_b(\gamma)=c_0+c_1+\dots +c_h\). For \(m,r \in \mathbb{Z}\) let \[ U_{r,m}=\{z\in {\mathbb{Z}}[i]: |z|^2 < N, \nu_b(z) \equiv r \pmod{m}\}. \] Assuming that \(\gcd(p_b(1),m)=1\) and denoting by \(T_{b,f}(N)\) the number of elements of \(U_{r,m}(N)\) that are not divisible by the \(f\)th power of a prime \((f\geq 2)\) it is proved that there exists a constant \(\mu < 1\) such that \[ T_{b,f}(N) = {\pi N \over m \zeta_{{\mathbf Q}(i)}(f)} + O(N^{\mu}) \] holds, where \(\zeta_{\mathbb{Q}(i)}\) denotes the Dedekind-zeta function of the Gaussian number field. Further, if \[ Q_N(X) = {1 \over |U_{r,m}(N)|}\left|\{z : z \in U_{r,m}(N), \omega(z) - \log \log N \leq X \sqrt{\log \log N} \} \right|, \] where \(\omega(z)\) counts the distinct prime divisors of \(z\), then \[ \left|\mathbb{Q}_N(X) - \psi(X) \right|\ll {\log \log \log N \over \sqrt{\log \log N}} \] holds uniformly for \(X \in {\mathbb{R}}\) and \(N\geq 8\). Here \(\psi(X)\) denotes the normal law.
    0 references
    0 references
    radix representation
    0 references
    Gaussian integers
    0 references
    sum of digits function
    0 references
    Erdős-Kac Theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references