Multiplicative functions resembling the Möbius funciton

preprint2022arXivOpen access

Abstract

A multiplicative function ff is said to be resembling the Möbius function if ff is supported on the square-free integers, and f(p)=±1f(p)=\pm 1 for each prime pp. We prove OO- and ΩΩ-results for the summatory function ∑n≤xf(n)\sum_{n\leq x} f(n) for a class of these ff studied by Aymone, and the point is that these OO-results demonstrate cancellations better than the square-root saving. It is proved in particular that the summatory function is O(x1/3+ε)O(x^{1/3+\varepsilon}) under the Riemann Hypothesis. On the other hand it is proved to be Ω(x1/4)Ω(x^{1/4}) unconditionally. It is interesting to compare these with the corresponding results for the Möbius function.

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.