Weighted averages of arithmetic functions and applications to equidistribution
Vitaly Bergelson, Michael Reilly, Florian K. Richter

TL;DR
This paper develops a general method for estimating weighted averages of arithmetic functions and applies it to study the uniform distribution of sequences derived from prime factor counts and Hardy field functions.
Contribution
It introduces a broad theorem for weighted averages of arithmetic functions satisfying Gaussian distribution conditions, with applications to uniform distribution problems.
Findings
Sequences like ig(\u03a9(n)) are uniformly distributed mod 1 if and only if the exponent is a non-integer greater than 1/2.
The main theorem applies to functions ig(h(\u03a9(n))) with Hardy field functions, characterizing their distribution.
New results on the distribution of sequences involving ig(ig( ig)), ig(ig( ig)), and ig(ig( ig)).
Abstract
For a wide range of functions , 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)), \] where is an arbitrary function, and is any arithmetic function that adheres to a certain Gaussian distribution condition. (In particular, one can take , , or , where and count the number of prime factors of with and without multiplicities respectively, and denotes the -th squarefree number.) As an application of our main theorem, we show that if is a function from a Hardy field with polynomial growth then is uniformly distributed mod if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
