Smooth sums over smooth k-free numbers and statistical mechanics

\(\alpha\)-convolution \(k\)-free number arithmetic function average order characteristic function smooth number smooth sum the Dickman-de Bruin distribution weak convergence

Mathematics Subject Classification ID

Arithmetic functions in probabilistic number theory (11K65) Asymptotic results on arithmetic functions (11N37) Convergence of probability measures (60B10) Central limit and other weak theorems (60F05)

Abstract: We provide an asymptotic estimate for certain sums over k-free integers with small prime factors. These sums depend upon a complex parameter alpha and involve a smooth cut-off f. They are a variation of several classical number-theoretical sums. One term in the asymptotics is an integral operator whose kernel is the alpha-convolution of the Dickman-de Bruijn distribution, and the other term is explicitly estimated. The trade-off between the value of alpha and the regularity of f is discussed. This work generalizes the results of tow previous papers by the author and Ya.G. Sinai, where k=2 and alpha=1.

Review text

Let \(k\geqslant 2\) be an integer number. A number \(n\) is called \(k\)-free if \(p^k\nmid n\) for every prime number \(p\). The paper is devoted to the study of the asymptotic behavior of the following smooth sum \[ \sum_{\substack{ n \text{ is \(k\)-free} \\ p|n \;\Rightarrow\;p\leqslant N}} f\left(\frac{\log n}{\log N}\right)\frac{\alpha^{\Omega(n)}}{n} \] as \(N\rightarrow\infty\). Here \(k\geqslant 2\), \(\alpha\in \mathbb{C}\) and a bounded function \(f:\mathbb{R}\rightarrow\mathbb{C}\) are fixed, while \(\Omega(n)\) denote the number of prime divisors of \(n\), counted with multiplicity.

Recommendations

Cited in

(4)

This page was built for publication: Smooth sums over smooth \(k\)-free numbers and statistical mechanics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249145)