Related papers: Optimal bounds for sums of bounded arithmetic func…
This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…
Let $S = \{ {A_1},{A_2}, \cdots ,{A_n}\} $ be a finite point set in m-dimensional Euclidean space ${E^m}$, and$\left\| {{A_i}{A_j}} \right\|$ be the distance between $A_i$ and $A_j$. Define $\sigma (S) = \sum\limits_{1 \le i < j \le n}…
We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.
We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…
In this note we establish a uniform bound for the distribution of a sum $S_n=X_1+\cdots+X_n$ of independent non-homogeneous Bernoulli trials. Specifically, we prove that $\sigma_n \mathbb{P}(S_n\!=\!j)\leq\eta$ where $\sigma_n$ denotes the…
In this article, we study the summatory function \begin{equation*} W(x)=\sum_{n\leq x}(-2)^{\Omega(n)}, \end{equation*} where $\Omega(n)$ counts the number of prime factors of $n$, with multiplicity. We prove $W(x)=O(x)$, and in particular,…
For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…
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…
We evaluate the asymptotic size of various sums of G\'al type, in particular $$S( \mathcal{M}):=\sum_{m,n\in\mathcal{M}} \sqrt{(m,n) \over [m,n]},$$ where $\mathcal{M}$ is a finite set of integers. Elaborating on methods recently developed…
We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$
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…
Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…
Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…
We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…
Given a Dirichlet series $L(s) = \sum a_n n^{-s}$, the asymptotic growth rate of $\sum_{n\le X} a_n$ can be determined by a Tauberian theorem. Bounds on the error term are typically controlled by the size of $|L(\sigma+it)|$ for fixed real…
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)|.
In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which…
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…
We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into…
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…