Friable averages of complex arithmetic functions
Let \(P^+(n)\) denote the largest prime factor of a natural integer \(n>1\) with \(P^+(1)=1\), and \(S(x,y):=\{n\leqslant x:P^+(n)\leqslant y\}\) be the set of \(y\)-friable integers not exceeding \(x\). In the paper under review, the authors approximate friable sums\N\[\N\Psi(x,y;f):=\sum_{n\in S(x,y)}f(n)\N\]\Nfor complex arithmetical functions \(f\), whose Dirichlet series is analytically close to some complex power of the Riemann zeta function. The authors give some applications to the distribution of additive functions over \(S(x,y)\), more precisely to the small omega function \(\omega(n)=\sum_{p|n}1\), hence obtaining an Erdős-Kac type theorem for friable integers.
- A Brun-Titschmarsh theorem for multiplicative functions.
- An Erdös-Kac theorem for integers without large prime factors
- Erdős-Kac theorem for smooth and ultra-smooth integers
- Friable integers: Turán-Kubilius inequality and applications
- scientific article; zbMATH DE number 4017016 (Why is no real title available?)
- scientific article; zbMATH DE number 4187930 (Why is no real title available?)
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Moyennes de certaines fonctions multiplicatives sur les entiers friables
- Moyennes de certaines fonctions multiplicatives sur les entiers friables, 2
- On a class of differential-difference equations arising in number theory
- On the number of prime factors of integers without large prime divisors
- Remarks on the mean values of Piltz functions over friable integers
- Sur les puissances de convolution de la fonction de Dickman
This page was built for publication: Friable averages of complex arithmetic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619679)
