Related papers: Weighted Erd\H{o}s-Kac Theorems via Computing Mome…

Fix a number field $K$. For each nonzero $\alpha \in \mathbb{Z}_K$, let $\nu(\alpha)$ denote the number of distinct, nonassociate irreducible divisors of $\alpha$. We show that $\nu(\alpha)$ is normally distributed with mean proportional to…

In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…

Based on the seminal work of Hutchinson, we investigate properties of {\em $\alpha$-weighted Cantor measures} whose support is a fractal contained in the unit interval. Here, $\alpha$ is a vector of nonnegative weights summing to $1$, and…

We study the moments and the distribution of the discrete Choquet integral when regarded as a real function of a random sample drawn from a continuous distribution. Since the discrete Choquet integral includes weighted arithmetic means,…

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erd\"os-Kac theorem for additive arithmetic functions $\psi$ of a random integer $J_n$ uniformly distributed over…

Let $h(d)$ be the class number of indefinite binary quadratic forms of discriminant $d$, and let $\varepsilon_d$ be the corresponding fundamental unit. In this paper, we obtain an asymptotic formula for the $k$-th moment of $h(d)$ over…

We give a relatively easy proof of the Erd\H os-Kac theorem via computing moments. We show how this proof extends naturally in a sieve theory context, and how it leads to several related results in the literature.

In 2020, Bergelson and Richter gave a dynamical generalization of the classical Prime Number Theorem, which has been generalized by Loyd in a disjoint form with the Erd\H{o}s-Kac Theorem. These generalizations reveal the rich ergodic…

This paper presents the probability distribution function (p.d.f.) and cumulative distribution function (c.d.f.) of the weighted sum of central independent chi-squared random variables with non-zero weighs based on a method using moment…

Let $f$ be a real polynomial with irrational leading co-efficient. In this article, we derive distribution of $f(n)$ modulo one for all $n$ with at least three divisors and also we study distribution of $f(n)$ for all square-free $n$ with…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

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…

Let $u(x)$ be a subpolynomial function in a Hardy field. We establish necessary and sufficient conditions for the weighted uniform distribution of the sequences $(u(n))_{n\in\mathbb{N}}$ and $(u(p_n))_{n\in\mathbb{N}}$, where $p_n$ denotes…

We establish unconditional $\Omega$-results for all weighted even moments of primes in arithmetic progressions. We also study the moments of these moments and establish lower bounds under GRH. Finally, under GRH and LI we prove an…

The structure of the multiplicative group $M_n = ({\mathbb Z}/n{\mathbb Z})^\times$ encodes a great deal of arithmetic information about the integer $n$ (examples include $\phi(n)$, the Carmichael function $\lambda(n)$, and the number…

Let $x\geqslant 3$. For $1\leqslant n\leqslant x$ an integer, let $\omega(n)$ be its number of distinct prime factors. We show that $\omega(n-1)$ satisfies an Erd\H{o}s-Kac type theorem whenever $\omega(n)=k$ where $1\leqslant k\ll\log\log…

In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.

This paper focuses on extensions of the classic Erd\H{o}s-Gallai Theorem for the set of weighted function of each edge in a graph. The weighted function of an edge $e$ of an $n$-vertex uniform hypergraph $\mathcal{H}$ is defined to a…