Related papers: A Generalization of the Erd\H{o}s-Kac Theorem
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 $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…
Transforming the Erd\H{o}s-Kac theorem provides more flexibility in how the theorem can be utilized as an interval estimate for the prime omega function, which counts the number of distinct prime divisors. Here, we consider a direct…
Let $2 \leq y \leq x$ such that $\beta := \frac{\log x}{\log y} \rightarrow \infty$. Let $\omega_y(n)$ denote the number of distinct prime factors $p$ of $n$ such that $p \leq y$, and let $\mu_y(n) := \mu^2(n)(-1)^{\omega_y(n)}$, where…
Granville and Soundararajan showed that the $k$th moment in the Erd\H{o}s--Kac theorem is equal to the $k$th moment of the standard Gaussian distribution in the range $k=o((\log \log x)^{1/3})$, up to a negligible error term. We show that…
Let $\{U(n)\}_{n \geq 0}$ be a sequence of independent random variables such that $U(n)$ is distributed uniformly on $\{0, 1, 2 \dots n\}$. The Ulam-Kac adder is the history-dependent random sequence defined by $X_{n + 1} = X_{n} +…
We prove entropic and total variation versions of the Erd\H{o}s-Kac limit theorem for the maximum of the partial sums of i.i.d. random variables with densities.
We investigate the number of prime factors of individual entries for matrices in the special linear group over the integers. We show that, when properly normalised, it satisfies a central limit theorem of Erd\H{o}s-Kac-type. To do so, we…
We show that the Erd\H{o}s-Kac theorem is valid in almost all intervals $\left[x,x+h\right]$ as soon as $h$ tends to infinity with $x$. We also show that for all $k$ near $\log\log x$, almost all interval $\left[x,x+\exp\left(\left(\log\log…
The classical Mertens' formula states that $ \prod_{p\le N}\big(1-\frac1p)^{-1}\sim e^\gamma\log N, $ where the product is over all primes $p$ less than or equal to $N$, and $\gamma$ is the Euler-Mascheroni constant. By the Euler product…
Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…
Let $I(n)$ denote the number of isomorphism classes of subgroups of $(\Bbb Z/n\Bbb Z)^\times$, and let $G(n)$ denote the number of subgroups of $(\Bbb Z/n\Bbb Z)^\times$ counted as sets (not up to isomorphism). We prove that both $\log…
We study probability distributions arising from local obstructions to the existence of $p$-adic points in families of varieties. In certain cases we show that an Erd\H{o}s-Kac type law holds.
For a wide range of functions $W\colon\mathbb{N}\to\mathbb{N}$, we establish a general result for estimating weighted averages of the form \[ \mathbb{E}^{W}_{n \le N} f(\vartheta(n))= \frac{1}{W(N)}\sum_{n=1}^N (W(n)-W(n-1))f(\vartheta(n)),…
Kagan and Shalaevski 1967 have shown that if the random variables $X_1,\dots,X_n$ are independent and identically distributed and the distribution of $\sum_{i=1}^n(X_i+a_i)^2$ $a_i\in \mathbb{R}$ depends only on $\sum_{i=1}^na_i^2$ , then…
Let $m\geq 2$ be a positive integer. Given a set $E(\omega )\subseteq \mathbb{N}$ we define $r_{N}^{(m)}(\omega )$ to be the number of ways to represent $N\in \mathbb{Z}$ as any combination of sums $\textit{ and }$ differences of $m$…
Elliott and Halberstam proved that $\sum_{p<n} 2^{\omega(n-p)}$ is asymptotic to $\phi(n)$. In analogy to the Erd\H{o}s--Kac Theorem, Elliott conjectured that if one restricts the summation to primes $p$ such that $\omega(n-p)\le 2 \log…
The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…
Let $\{p_j\}_{j=1}^\infty$ denote the set of prime numbers in increasing order, let $\Omega_N\subset \mathbb{N}$ denote the set of positive integers with no prime factor larger than $p_N$ and let $P_N$ denote the probability measure on…
The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…