English
Related papers

Related papers: Fonctions compl\`etement multiplicatives de somme …

200 papers

$CMO$ functions are completely multiplicative functions $f$ for which $\sum_{n=1}^\infty f(n)$ $=0$. These functions were first introduced and studied by Kahane and Sa\"{i}as [5]. The main purpose of this paper is to generalise such…

Number Theory · Mathematics 2021-08-27 Ammar Ali Neamah

Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1 on the prime numbers (the Liouville function). We extend…

Number Theory · Mathematics 2016-03-16 Jean-Pierre Kahane , Eric Saïas

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

Number Theory · Mathematics 2021-10-29 Oleksiy Klurman , Alexander P. Mangerel , Cosmin Pohoata , Joni Teräväinen

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

Number Theory · Mathematics 2022-07-11 Marco Aymone

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

Number Theory · Mathematics 2022-06-15 Marco Aymone , Caio Bueno , Kevin Medeiros

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Number Theory · Mathematics 2015-01-27 Colin Defant

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

Number Theory · Mathematics 2026-03-25 Rodrigo Angelo , Max Wenqiang Xu

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

Number Theory · Mathematics 2019-02-20 Oleksiy Klurman

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…

Number Theory · Mathematics 2022-06-10 Qingyang Liu

In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-\delta}$, for some $\delta>0$, and if the Dirichlet series…

Number Theory · Mathematics 2021-11-30 Marco Aymone

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

Number Theory · Mathematics 2019-11-22 Marco Aymone , Vladas Sidoravicius

We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…

Number Theory · Mathematics 2018-01-11 Oleksiy Klurman , Alexander P. Mangerel

Let $f$ be a real-valued $1$-bounded multiplicative function. Suppose that the mean-value of $f^{2}$ exists, and $$\int_{0}^{1} \Big | \sum_{n \leq N} f(n)e^{2\pi i n \alpha} \Big | d \alpha\leq N^{o(1)}$$ as $N \rightarrow \infty$, then…

Number Theory · Mathematics 2025-10-24 Mayank Pandey , Maksym Radziwiłł

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

Number Theory · Mathematics 2011-08-26 Michael Coons

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan

The Landau-Selberg-Delange method provides an asymptotic formula for the partial sums of a multiplicative function whose average value on primes is a fixed complex number $v$. The shape of this asymptotic implies that $f$ can get very small…

Number Theory · Mathematics 2020-05-13 Dimitris Koukoulopoulos , K. Soundararajan

It is known that if the proximate order $\rho(r)$ such that $\lim \rho(r) = \rho > 0 (r \to \infty)$, then there exists an entire function $f(z)$ of proximate order $\rho(r)$. In the case where $\rho = 0$ the question about the existence of…

Complex Variables · Mathematics 2014-03-24 A. F. Grishin , Nguyen Van Quynh

Let $f$ be a multiplicative function which satisfies \[ f(a^2+b^2+c^2+d^2) = f(a^2+b^2)+f(c^2+d^2) \] for positive integers $a$, $b$, $c$, and $d$. We show that $f$ is the identity function provided that $f(3)\,f(11) \ne 0$. Otherwise,…

Number Theory · Mathematics 2019-03-26 Poo-Sung Park

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault

Let $\kl_n(a,b;m)$ be the hyper-Kloosterman sum. Fix integers $n\geqslant2,a\neq0$, $b\neq0$ and $k\geqslant2$. For any $0\neq\eta\in\mathbb{C}$ and multiplicative function $f: \mathbb{N} \rightarrow \mathbb{C}$, we prove that…

Number Theory · Mathematics 2025-12-12 Yang Zhang
‹ Prev 1 2 3 10 Next ›