Related papers: On Benford's Law for multiplicative functions

Benford's law is frequently used to evaluate the likihood that data is misrepresentative. Typically statistical tests measure the likihood. Another method of employing Benford's law is to compare the frequency of leading digits to the…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

The $S$-functional calculus is based on the theory of slice hyperholomorphic functions and it defines functions of $n$-tuples of not necessarily commuting operators or of quaternionic operators. This calculus relays on the notion of…

We establish a strong law of large numbers under intermediate trimming for a particular example of Birkhoff sums of a non-integrable observable over the doubling map. It has been shown in a previous work by Haynes that there is no strong…

Let G be a finite group and let k be a positive integer. We examine the relationship between structural properties of G and the number of elements of G that are not kth powers in G. In particular, we examine a bound on |G| given by Lucido…

In this paper, some classes of discrete functions of $k$-valued logic are considered, that depend on sets of their variables in a particular way. Obtained results allow to "construct" these functions and to present them in their tabular,…

It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

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…

We prove the Banach strong Novikov conjecture for groups having polynomially bounded higher-order combinatorial functions. This includes all automatic groups.

An affine algebraic variety $X$ is rigid if the algebra of regular functions ${\mathbb K}[X]$ admits no nonzero locally nilpotent derivation. We prove that a factorial trinomial hypersurface is rigid if and only if every exponent in the…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

Benford's law is an empirical ``law'' governing the frequency of leading digits in numerical data sets. Surprisingly, for mathematical sequences the predictions derived from it can be uncannily accurate. For example, among the first billion…

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

We consider random linear unbounded operators on a Banach space $\mathcal{X}$. For example, such random operators may be random quantum channels. The Law of Large Numbers is known when $\mathcal{X}$ is a Hilbert space, in the form of the…

Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…

We prove bounds for multilinear operators on $\R^d$ given by multipliers which are singular along a $k$ dimensional subspace. The new case of interest is when the rank $k/d$ is not an integer. Connections with the concept of {\em true…

There are now many theoretical explanations for why Benford's law of digit bias surfaces in so many diverse fields and data sets. After briefly reviewing some of these, we discuss in depth recurrence relations. As these are discrete…