Fonctions complètement multiplicatives de somme nulle

preprint2015arXivOpen access

Abstract

Completely multiplicative functions whose sum is zero (CMOCMO).The paper deals with CMOCMO, meaning completely multiplicative (CMCM) functions ff such that f(1)=1f(1)=1 and ∑_1∞f(n)=0\sum\limits\_1^\infty f(n)=0. CMCM means f(ab)=f(a)f(b)f(ab)=f(a)f(b) for all (a,b)∈N∗2(a,b)\in \N^{*2}, therefore ff is well defined by the f(p)f(p), pp prime. Assuming that ff is CMCM, give conditions on the f(p)f(p), either necessary or sufficient, both is possible, for ff being CMOCMO : that is the general purpose of the authors.The CMOCMO character of ff is invariant under slight modifications of the sequence (f(p))(f(p)) (theorem 3). The same idea applies also in a more general context (theorem 4).After general statements of that sort, including examples of CMOCMO (theorem 5), the paper is devoted to "small" functions, that is, functions of the form f(n)n\frac{f(n)}{n}, where the f(n)f(n) are bounded. Here is a typical result : if ∣f(p)∣≤1|f(p)|\le 1 and Re f(p)≤0Re\, f(p)\le0 for all pp, a necessary and sufficient condition for (f(n)n)\big(\frac{f(n)}{n}\big) to be CMOCMO is ∑ Re f(p)/p=−∞\sum \, Re\, f(p)/p=-\infty (theorem 8). Another necessary and sufficient condition is given under the assumption that ∣1+f(p)∣≤1|1+f(p)|\le 1 and f(2)≠−2f(2)\not=-2 (theorem 7). A third result gives only a sufficient condition (theorem 9). The three results apply to the particular case f(p)=−1f(p)=-1, the historical example of Euler.Theorems 7 and 8 need auxiliary results, coming either from the existing literature (Halász, Montgomery--Vaughan), or from improved versions of classical results (Ingham, Skał ba) about f(n)f(n) under assumptions on the f∗1(n)f*1(n), * denoting the multiplicative convolution (theorems 10 and 11).

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.