Denote by $\lambda \left(n\right)$ Liouville’s function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mendès France, and Peyrière and many classical results from the theory of the distribution of prime numbers, we prove that $\lambda \left(n\right)$ is not $k$–automatic for any $k\>2$. This yields that ${\sum }_{n=1}^{\infty }\lambda \left(n\right)X^n\in {𝔽}_p\left[\left[X\right]\right]$ is transcendental over ${𝔽}_p\left(X\right)$ for any prime $p\>2$. Similar results are proven (or reproven) for many common number–theoretic functions, including $\varphi$, $\mu$, $\Omega$, $\omega$, $\rho$, and others.

We establish “higher depth” analogues of regularized determinants due to Milnor for zeros of cuspidal automorphic $L$-functions of ${\mathrm{GL}}_d$ over a general number field. This is a generalization of the result of Deninger about the regularized determinant for zeros of the Riemann zeta function.

The present paper deals with the summatory function of functions acting on the digits of an $q$-ary expansion. In particular let $n$ be a positive integer, then we call $$\begin{array}{c}n=\sum _{r=0}^{\ell }{d}_r\left(n\right)q^r\text{with}{d}_r\left(n\right)\in \{0,...,q-1\}\end{array}$$ its $q$-ary expansion. We call a function $f$ strictly $q$-additive, if for a given value, it acts only on the digits of its representation, i.e., $$f\left(n\right)=\sum _{r=0}^{\ell }f\left(d_r\left(n\right)\right).$$ Let $p\left(x\right)={\alpha }_0{x}^{{\beta }_0}+\cdots +{\alpha }_d{x}^{{\beta }_d}$ with ${\alpha }_0,{\alpha }_1,...,{\alpha }_d,\in ℝ$, ${\alpha }_0\>0$, ${\beta }_0\>\cdots \>{\beta }_d\ge 1$ and at least one ${\beta }_i\notin \mathbb{Z}$. Then we call $p$ a pseudo-polynomial. ...

Let $\beta \>1$ be an algebraic number. We study the strings of zeros (“gaps”) in the Rényi $\beta$-expansion  $d_{\beta }\left(1\right)$ of unity which controls the set ${\mathbb{Z}}_{\beta }$ of $\beta$-integers. Using a version of Liouville’s inequality which extends Mahler’s and Güting’s approximation theorems, the strings of zeros in $d_{\beta }\left(1\right)$ are shown to exhibit a “gappiness” asymptotically bounded above by  $log\left(\mathrm{M}\right(\beta \left)\right)/log\left(\beta \right)$, where  $\mathrm{M}\left(\beta \right)$  is the Mahler measure of  $\beta$. The proof of this result provides in a natural way a new classification of algebraic numbers $\>1$ with classes...