Multiplicative functions and small divisors. II (Q1115474): Difference between revisions

Let \(k\) be an integer \(\geq 2\) and \(h\) a multiplicative function satisfying \(0\leq h(p)\leq 1/(k-1)\) for every prime \(p\). The authors show that, for any squarefree integer \(h\), \[ \sum_{d\mid n}h(d) \leq (2k+o(1)) \sum_{d\mid n;d \leq n^{1/k}}h(d), \tag{*} \] where \(o(1)\) is a quantity that tends to zero as the number of prime divisors of \(n\) tends to infinity. In part I of the present paper [Analytic number theory and diophantine problems, Prog. Math. 70, 1--13 (1987; Zbl 0626.10004)] the authors had obtained a similar result but under the stronger hypothesis that \(0 \leq h(p) \leq c\) for some fixed constant \(c< 1/(k-1).\) The proof of (*) rests on a deep theorem of Z. Baranyai on hypergraphs. The authors give heuristic arguments suggesting that (*) remains true with the constant \(4+o(1)\) in place of \(2k+o(1)\) and for any real \(k\geq 2.\) \{Note: A result similar to the authors' had been obtained very recently by \textit{B. Landreau} [C. R. Acad. Sci., Paris, Sér. I 307, No. 14, 743--748 (1988; Zbl 0658.10053)].\}