English
Related papers

Related papers: Multiplicative functions resembling the M\"{o}bius…

200 papers

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 $1/2\leq\beta<1$, $p$ be a generic prime number and $f_\beta$ be a random multiplicative function supported on the squarefree integers such that $(f_\beta(p))_{p}$ is an i.i.d. sequence of random variables with distribution…

Number Theory · Mathematics 2020-09-22 Marco Aymone

We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…

Number Theory · Mathematics 2018-10-17 Lilian Matthiesen

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Number Theory · Mathematics 2026-02-04 Christopher Atherfold

We consider $\omega(n)$ and $\Omega(n)$, which respectively count the number of distinct and total prime factors of $n$. We survey a number of similarities and differences between these two functions, and study the summatory functions…

Number Theory · Mathematics 2020-06-25 Michael J. Mossinghoff , Timothy S. Trudgian

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations…

Combinatorics · Mathematics 2023-10-23 Mircea Merca , Maxie D. Schmidt

By using exclusively real analysis, we give explicit estimates of some classical summatory functions involving the M\"obius function.

Number Theory · Mathematics 2025-05-28 Florian Daval

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

We establish cancellation in short sums of certain special trace functions over $\mathbb{F}_q[u]$ below the P\'{o}lya-Vinogradov range, with savings approaching square-root cancellation as $q$ grows. This is used to resolve the…

Number Theory · Mathematics 2020-08-25 Will Sawin , Mark Shusterman

Assuming the Riemann Hypothesis we establish an upper bound for the sum of the M{\" o}bius function up to $x$. Our method is based on estimating the frequency with which intervals of a given length can contain an unusual number of ordinates…

Number Theory · Mathematics 2008-02-13 K. Soundararajan

This article provides new asymptotic results for the summatory Mobius function $\sum_{p \leq x} \mu(p+a) =O \left (x(\log x)^{-c} \right )$ and the summatory Liouville function $\sum_{p \leq x} \lambda(p+a) =O \left (x(\log x)^{-c} \right…

General Mathematics · Mathematics 2022-07-26 N. A. Carella

$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

We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…

Number Theory · Mathematics 2020-07-09 Kaisa Matomäki , Maksym Radziwiłł

We prove that the M\"obius function is orthogonal to polynomials over $\mathbb{F}_q[x]$ (up to a characteristic condition). We use this orthogonality property to count prime solutions to affine-linear equations of bounded complexity in…

Number Theory · Mathematics 2024-10-15 Tal Meilin

We discuss the multiplicity of the non-trivial zeros of the Riemann zeta-function and the summatory function $M(x)$ of the M\"obius function. The purpose of this paper is to consider two open problems under some conjectures. One is that…

Number Theory · Mathematics 2017-06-23 Shōta Inoue

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

Number Theory · Mathematics 2007-05-23 László Tóth , Eduard Wirsing

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding M\"obius prime-function, which in the limit of infinitely large primes becomes identical to the original M\"obius function.…

General Mathematics · Mathematics 2011-09-28 R. M. Abrarov , S. M. Abrarov

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

Number Theory · Mathematics 2026-01-28 Priyamvad Srivastav

We embed the somewhat unusual multiplicative function, which was serendipitously discovered in 2010 during a study of mutually unbiased bases in the Hilbert space of quantum physics, into two families of multiplicative functions that we…

Number Theory · Mathematics 2021-08-17 Heng Huat Chan , Berthold-Georg Englert

Let $\Psi(x,y)$ denote the count of $y$-smooth numbers below $x$ and $P(n)$ denote the largest prime factor of $n$. We prove that for $f$ a Steinhaus random multiplicative function, the partial sums over $y$-smooth numbers always enjoy…

Number Theory · Mathematics 2026-02-09 Seth Hardy , Max Wenqiang Xu