Related papers: $M(x)=o(x)$ Estimates for Beurling numbers

The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…

Let the summatory function of the M\"{o}bius function be denoted $M(x)$. We deduce in this article conditional results concerning $M(x)$ assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the…

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…

Given $\beta\in(0,1)$, we show the existence of a Beurling generalized number system whose integer counting satisfies $N(x) = ax + O\bigl(x\exp(-c\log^{\beta} x)\bigr)$ for some $a>0$ and $c>0$, and whose prime counting function satisfies…

Let $\mu(n)$ be the M\"{o}bius function and $e(\alpha)=e^{2\pi i\alpha}$. In this paper, we study upper bounds of the classical sum $$S(x,\alpha):=\sum_{1\leq n\leq x}\mu(n)e(\alpha n).$$ We can improve some classical results of Baker and…

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…

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…

In this paper, we derive new properties of the Mertens function and discuss a likely upper bound of the absolute value of the Mertens function $\sqrt{\log{x!}}>|M(x)|$ when $x>1$. Using this likely bound we show that we have a sufficient…

We present an elementary proof of the classical Beurling sampling theorem which gives a sufficient condition for sampling of multi-dimensional band-limited functions.

We prove quantitative estimates for averages of the von Mangoldt and M\"obius functions along polynomial progressions $n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials $P_i$. The error terms obtained save an arbitrary power of…

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

We establish quantitative bounds on the $U^k[N]$ Gowers norms of the M\"obius function $\mu$ and the von Mangoldt function $\Lambda$ for all $k$, with error terms of shape $O((\log\log N)^{-c})$. As a consequence, we obtain quantitative…

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

We consider a multiple arithmetical sum involving the Moebius function which despite its elementary appearance is in fact of a highly intriguing nature. We establish an asymptotic formula for the quadruple case that raises the first…

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

We establish nontrivial bounds for bilinear sums involving the M\"obius function evaluated over solutions to a broad class of equations. Several of our results may be regarded as M\"obius-function analogues of the ternary Goldbach problem.…

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…