English
Related papers

Related papers: On Benford's Law for multiplicative functions

200 papers

We prove that the generating function of partitions into $k$-th powers is strongly Gaussian in the sense of B\'aez-Duarte. Within the probabilistic framework of Khinchin families, the Hardy--Ramanujan asymptotic formula for the…

Probability · Mathematics 2026-04-07 José L. Fernández , Víctor J. Maciá

This article presents a concise proof of the famous Benford's law when the distribution has a Riemann integrable probability density function and provides a criterion to judge whether a distribution obeys the law. The proof is intuitive and…

Statistics Theory · Mathematics 2024-08-07 Luohan Wang , Bo-Qiang Ma

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

Number Theory · Mathematics 2014-09-11 Olivia Beckwith , Christine Bessenrodt

Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^m\tau_k$, where $\tau_k$ is a…

Number Theory · Mathematics 2015-10-20 Andrew V. Lelechenko

We study which integers are admissible as Fourier coefficients of even integer weight newforms. In the specific case of the tau-function, we show that for all odd primes $\ell < 100$ and all integers $m \geq 1$, we have $$ \tau(n) \neq \pm…

Number Theory · Mathematics 2021-03-16 Spencer Dembner , Vanshika Jain

Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…

Combinatorics · Mathematics 2014-02-26 Helene Barcelo , Victor Reiner , Dennis Stanton

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

Probability · Mathematics 2026-03-06 Bruce Fang , Steven J. Miller

Let (k(n)) n=1,2,... be a strictly increasing sequence of positive integers . We consider a specific sequence of differential operators Tk(n),{\lambda} , n=1,2,... on the space of entire functions , that depend on the sequence (k(n))…

Functional Analysis · Mathematics 2015-06-18 Nikos Tsirivas

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

Number Theory · Mathematics 2025-12-19 Gérald Tenenbaum

Let $k \geq 3$. If a multiplicative function $f$ satisfies \[ f(a_1^3 + a_2^3 + \cdots + a_k^3) = f(a_1^3) + f(a_2^3) + \cdots + f(a_k^3) \] for all $a_1, a_2, \ldots, a_k \in \mathbb{N}$, then $f$ is the identity function. The set of…

Number Theory · Mathematics 2023-02-16 Poo-Sung Park

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic

For a family of functionals defined on a Hilbert manifold and smoothly depending on a compact finite dimensional manifold, we give a sufficient condition on the parameter space in such a way the family bifurcate from the trivial branch.

Classical Analysis and ODEs · Mathematics 2013-07-25 Alessandro Portaluri

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Commutative Algebra · Mathematics 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe

According to Benford's law, the most significant digit in many datasets is not uniformly distributed, but obeys a well defined power law distribution with smaller digits appearing more often. Among one of the myriad particle physics…

Physics and Society · Physics 2018-05-18 Aisha Dantuluri , Shantanu Desai

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

Number Theory · Mathematics 2024-08-21 Chenhao Du , Qingfeng Sun

We find upper bounds that are sharp for the number of $k$th powers inside arbitrary arithmetic progressions whose step has $O(1)$ many divisors.

Number Theory · Mathematics 2018-12-11 Jean Bourgain , Ciprian Demeter

We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…

Number Theory · Mathematics 2010-12-23 Oscar Marmon

We show that an arithmetic function which satisfies some weak multiplicativity properties and in addition has a non-decreasing or $\log$-uniformly continuous normal order is close to a function of the form $n\mapsto n^c$. As an application…

Number Theory · Mathematics 2019-12-03 Jan-Christoph Schlage-Puchta

A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…

Combinatorics · Mathematics 2021-05-20 Gerhard Ramharter , Luca Q. Zamboni

In this paper, we give a simple criterion to verify that functions of the form $e^g$ are in the Hayman class when $g$ is a power series with nonnegative coefficients. Thus, using the Hayman and B\'aez-Duarte formulas, we obtain asymptotics…

Combinatorics · Mathematics 2022-05-20 Alicia Cantón , José L. Fernández , Pablo Fernández , Víctor J. Maciá