Beyond the LSD method for the partial sums of multiplicative functions

Abstract

The Landau-Selberg-Delange (LSD) method gives an asymptotic formula for the partial sums of a multiplicative function $f$ whose prime values are $\alpha$ on average. In the literature, the average is usually taken to be $\alpha$ with a very strong error term, leading to an asymptotic formula for the partial sums with a very strong error term. In practice, the average at the prime values may only be known with a fairly weak error term, and so we explore here how good an estimate this will imply for the partial sums of $f$, developing new techniques to do so.

Addressed referee's comments; added some references; corrected and simplified the proof of Theorem 9. 26 pages

Cited by in corpus (4)

• Generalizations of the Erdős-Kac Theorem and the Prime Number Theorem
• Multiplicative arithmetic functions and the generalized Ewens measure
• On multiplicative functions with small partial sums
• Malle's conjecture for fair counting functions