Related papers: Benford's Law for Coefficients of Newforms

The probability that a number in many naturally occurring tables of numerical data has first significant digit $d$ is predicted by Benford's Law ${\rm Prob} (d) = \log_{10} (1 + {\displaystyle{1\over d}}), d = 1, 2 >..., 9$. Illustrations…

The intriguing law of anomalous numbers, also named Benford's law, states that the significant digits of data follow a logarithmic distribution favoring the smallest values. In this work, we test the compliance with this law of the atomic…

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…

We explain Kossovsky's generalization of Benford's law which is a formula that approximates the distribution of leftmost digits in finite sequences of natural data and apply it to six sequences of data including populations of US cities and…

Let $f$ be a normalized, ordinary newform of weight $\ge 2$. For each prime $\mathfrak{p}$ of $F=\mathbb{Q}(a_n)_{n\in \mathbb{N}}$, there is an associated $\mathfrak{p}$-adic $L$-function $\mathcal{L}_\mathfrak{p}(f)\in \Lambda \otimes…

We develop two complementary generative mechanisms that explain when and why Benford's first-digit law arises. First, a probabilistic Turing machine (PTM) ensemble induces a geometric law for codelength. Maximizing its entropy under a…

Benford's law states that for many random variables X > 0 its leading digit D = D(X) satisfies approximately the equation P(D = d) = log_{10}(1 + 1/d) for d = 1,2,...,9. This phenomenon follows from another, maybe more intuitive fact,…

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…

Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…

Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the non-real zeros of $\zeta(s)$, that the set of real numbers $x\ge2$ for which $\pi(x)>$ li$(x)$ has a logarithmic…

The uneven distribution of digits in numerical data, known as Benford's law, was discovered in 1881. Since then, this law has been shown to be correct in copious numerical data relating to economics, physics and even prime numbers. Although…

Let $p$ be a prime and let $S_2(\Gamma(p))$ be the space of weight $2$ cusp forms for the principal congruence subgroup $\Gamma(p)$. Then $\mathrm{SL}_2(\mathbb{F}_p)$ acts on $S_2(\Gamma(p))$ in a natural way. Around 1928, Hecke proved…

Let $f_{\mathrm{new}}$ be a classical newform of weight $\geq 2$ and prime to $p$ level. We study the arithmetic of $f_{\mathrm{new}}$ and its unique $p$-stabilisation $f$ when $f_{\mathrm{new}}$ is $p$-irregular, that is, when its Hecke…

We found that in transition arrays of complex atomic spectra, the strengths of electric-dipolar lines obey Benford's law, which means that their significant digits follow a logarithmic distribution favoring the smallest values. This…

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…

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

For univalent and normalized functions $f$ the logarithmic coefficients $\gamma_n(f)$ are determined by the formula $\log(f(z)/z)=\sum_{n=1}^{\infty}2\gamma_n(f)z^n$. In the paper \cite{Pon} the authors posed the conjecture that a locally…

Researchers have observed that the frequencies of leading digits in many man-made and naturally occurring datasets follow a logarithmic curve, with digits that start with the number 1 accounting for $\sim 30\%$ of all numbers in the dataset…

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…

Let $f(z)=\sum_{n=1}^{\infty} a_f(n)e^{2\pi i n z}$ be a non-CM holomorphic cupsidal newform of trivial nebentypus and even integral level $k\geq 2$. Deligne's proof of the Weil conjectures shows that $|a_f(p)|\leq 2p^{\frac{k-1}{2}}$ for…