A Strengthening of Theorems of Halász and Wirsing

preprint2016arXivOpen access

Abstract

Given an arithmetic function g(n)g(n) write Mg(x):=∑n≤xg(n)M_g(x) := \sum_{n \leq x} g(n). We extend and strengthen the results of a fundamental paper of Halász in several ways by proving upper bounds for the ratio of ∣Mg(x)∣M∣g∣(x)\frac{|M_g(x)|}{M_{|g|}(x)}, for any strongly multiplicative, complex-valued function g(n)g(n) under certain assumptions on the sequence {g(p)}p\{g(p)\}_p. We further prove an asymptotic formula for this ratio in the case that ∣arg(g(p))∣|\text{arg}(g(p))| is sufficiently small uniformly in pp. In so doing, we recover a new proof of an explicit lower mean value estimate for Mf(x)M_{f}(x) for any non-negative, multiplicative function satisfying c1≤∣f(p)∣≤c2c_1 \leq |f(p)| \leq c_2 for c2≥c1>0c_2 \geq c_1 > 0, by relating it to xlog⁡x∏p≤x(1+f(p)p)\frac{x}{\log x}\prod_{p \leq x} \left(1+\frac{f(p)}{p}\right). As an application, we generalize our main theorem in such a way as to give explicit estimates for the ratio ∣Mg(x)∣Mf(x)\frac{|M_g(x)|}{M_{f}(x)}, whenever f:N→(0,∞)f: \mathbb{N} \rightarrow (0,\infty) and g:N→Cg: \mathbb{N} \rightarrow \mathbb{C} are strongly multiplicative functions that are uniformly bounded on primes and satisfy ∣g(n)∣≤f(n)|g(n)| \leq f(n) for every n∈Nn \in \mathbb{N}. This generalizes a theorem of Wirsing and extends recent work due to Elliott.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.