Related papers: On Benford's Law for multiplicative functions

We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…

For $D$ a natural number that is not a perfect square and for $k$ a non-zero integer, consider the subset $\mathbb{Z}_k(\sqrt{D})$ of the quadratic integer ring $\mathbb{Z}(\sqrt{D})$ consisting of elements $x+y\sqrt{D}$ for which $x^2 -…

Let $\tau$ denote the Ramanujan tau function. One is interested in possible prime values of $\tau$ function. Since $\tau$ is multiplicative and $\tau(n)$ is odd if and only if $n$ is an odd square, we only need to consider $\tau(p^{2n})$…

Let \tau(.) be the Ramanujan \tau-function, and let k be a positive integer such that \tau(n) is not 0 for n=1,...,[k/2]. (This is known to be true for k < 10^{23}, and, conjecturally, for all k.) Further, let s be a permutation of the set…

It is well-known that sequences such as the Fibonacci numbers and the factorials satisfy Benford's Law, that is, leading digits in these sequences occur with frequencies given by $P(d)=\log_{10}(1+1/d)$, $d=1,2,\dots,9$. In this paper, we…

Benford's law is the statement that in many real-world data sets, the probability of having digit \(d\) in base \(B\), where \(1 \leq d \leq B\), as the first digit is \(\log_{B}\left(\tfrac{d+1}{d}\right)\). We sometimes refer to this as…

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

Here we prove that Benford's law holds for coefficients of an infinite class of modular forms. Expanding the work of Bringmann and Ono on exact formulas for harmonic Maass forms, we derive the necessary asymptotics. This implies that the…

We obtain a new family of relations satisfied by the partition function. In contrast with most partition relations, these involve non-trivial roots of unity. We present two proofs, one using the fact that the discriminant modular form is a…

We show the leading digits of a variety of systems satisfying certain conditions follow Benford's Law. For each system proving this involves two main ingredients. One is a structure theorem of the limiting distribution, specific to the…

Let $f(z)=\sum_{n=1}^\infty \lambda_f(n)e^{2\pi i n z}\in S_{k}^{new}(\Gamma_0(N))$ be a normalized Hecke eigenform of even weight $k\geq2$ on $\Gamma_0(N)$ without complex multiplication. Let $\mathbb{P}$ denote the set of all primes. We…

In the literature, Benford's Law is considered for base-b expansions where b>1 is an integer. In this paper, we investigate the distribution of leading "digits" of a sequence of positive integers under other expansions such as Zeckendorf…

A sequence of points $z_k$ in the unit disk is said to be thin for a given decrease function $\rho$, if there is a nontrivial bounded holomorphic function such that the infinite series $\sum_k \rho(1-|z_k|)|f(z_k)|$ converges. All sequences…

We provide conditions which yield a strong law of large numbers for expressions of the form $1/N\sum_{n=1}^{N}F\big(X(q_1(n)),..., X(q_\ell(n))\big)$ where $X(n),n\geq 0$'s is a sufficiently fast mixing vector process with some moment…

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

It is proved that every function of finite Baire index on a separable metric space $K$ is a $D$-function, i.e., a difference of bounded semi-continuous functions on $K$. In fact it is a strong $D$-function, meaning it can be approximated…

We show how Benford's Law (BL) for first, second, ..., digits, emerges from the distribution of digits of numbers of the type $a^{R}$, with $a$ any real positive number and $R$ a set of real numbers uniformly distributed in an interval $[…

This paper deals with strong invariance principles (known also as strong approximation theorems) for sums of the form $\sum_{n=1}^{[Nt]}F\big(X(n),X(2n),...,X(kn), X(q_{k+1}(n)),X(q_{k+2}(n)),..., X(q_\ell(n))\big)$

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…