Related papers: Bounding sums of the M\"obius function over arithm…

In this paper, we establish new explicit bounds for the Mertens function $M(x)$. In particular, we compare $M(x)$ against a short-sum over the non-trivial zeros of the Riemann zeta-function $\zeta(s)$, whose difference we can bound using…

Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number…

Here we investigate the $q$-series \begin{align*} \mathcal{U}_a(q)&=\sum_{n=0}^{\infty} MO(a;n)q^n&:=\sum_{0< k_1<k_2<\cdots<k_a} \frac{q^{k_1+k_2+\cdots+k_a}}{(1-q^{k_1})^2(1-q^{k_2})^2\cdots(1-q^{k_a})^2},\\…

Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.

Riemann sums, a classical method for approximating the definite integral of a function, have been extensively studied in the past. However, their monotonic properties, while still of great importance, particularly in approximation theory…

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

In this paper we give a short interval version of the Balog-Ruzsa theorem concerning bounds for the $L_1$ norm of the exponential sum over $r$-free numbers. As an application, we give a lower bound for the $L_1$ norm of the exponential sum…

Let $a\in \mathbb{R}^{+}\backslash\left\{0\right\}$ and $M\in\mathbb{N}$. We consider the equation $t^M-a=0$, which is equivalent to $1-\frac{t^M}{a}=0\,.$ The real solution is $\sqrt[M]{a}$. In this publication, we present a method that…

Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation.…

Let $d(n)$ be the divisor function. In 1916, S. Ramanujan stated but without proof that $$\sum_{n\leq x}d^2(n)=xP(\log x)+E(x), $$ where $P(y)$ is a cubic polynomial in $y$ and $$ E(x)=O(x^{{3\over 5}+\epsilon}), $$ where $\epsilon$ is a…

Let $\lambda$ denote the Liouville function. We prove that $$\sum_{X \leq x < 2X} \sup_{\alpha \in \mathbb{R}/\mathbb{Z}} \bigg\lvert\!\sum_{x \leq n < x+H} \lambda(n) e(n\alpha)\bigg\rvert = o(HX)$$ as $X\to \infty$, in the regime $H =…

The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…

Let $\pi S(t)$ denote the argument of the Riemann zeta-function, $\zeta(s)$, at the point $s=\frac{1}{2}+it$. Assuming the Riemann hypothesis, we present two proofs of the bound $$ |S(t)| \leq \left(\tfrac{1}{4} + o(1) \right)\tfrac{\log…

Let $x\geq 1$ be a large integer, and let $\mu:\mathbb{N}\longrightarrow\{-1,0,1\}$ be the Mobius function. This article proposes an effective asymptotic result for the autocorrelation function $\sum_{n \leq x} \mu(n) \mu(n+t) =O\left(…

We prove upper bounds for the error term of the distribution of squarefree numbers up to $X$ in arithmetic progressions modulo $q$ making progress towards two well-known conjectures concerning this distribution and improving upon earlier…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

We study in an explicit manner the partial sums of the multiplicative inverse of the Riemann zeta function and its derivative.

A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…