Related papers: Some ergodic theorems over $k$-full numbers

In 2022, Bergelson and Richter gave a new dynamical generalization of the prime number theorem by establishing an ergodic theorem along the number of prime factors of integers. They also showed that this generalization holds as well if the…

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…

In this paper, we study the linear independence between the distribution of the number of prime factors of integers and that of the largest prime factors of integers. Respectively, under a restriction on the largest prime factors of…

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers. In 2004, the third author generalized their…

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers, and in 2004, the third author generalized…

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.

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, among the values $n\leqslant x$ with $\omega(n)=k$ where $1\leqslant k \ll \log_2 x$, $\omega(n-1)$…

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…

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

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…

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…

Hopf's ratio ergodic theorem has an inherent symmetry which we exploit to provide a simplification of standard proofs of Hopf's and Birkhoff's ergodic theorems. We also present a ratio ergodic theorem for conservative transformations on a…

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean…

We prove an Erd\H{o}s-Kac type of theorem for the set $S(x,y)=\{n\leq x: p|n \Rightarrow p\leq y \}$. If $\omega (n)$ is the number of prime factors of $n$, we prove that the distribution of $\omega(n)$ for $n \in S(x,y)$ is Gaussian for a…

This article shortly provides related proofs of the ergodic theorems of von Neumann, Birkhoff, Wiener, and Rokhlin's lemma for $Z^d$-actions with an invariant measure. It is shown how some deviations of ergodic averages can be structured.…

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

Gallagher's ergodic theorem is a result in metric number theory. It states that the approximation of real numbers by rational numbers obeys a striking 'all or nothing' behaviour. We discuss a formalisation of this result in the Lean theorem…

This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…