Related papers: General divisor function inequalities and the thir…

We give an upper bound for the exponential $\sum_{m=1}^M \exp( 2i\pi f (m))$ in terms of $M$ and $\lambda$, where $\lambda$ is a small positive number which denotes the size of the fourth derivative of the real valued function $f$. The…

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

We obtain a new bound on the second moment of modified shifted convolutions of the generalized 3-fold divisor function, and show that, for applications, the modified version is sufficient.

Ben Reichardt showed in a series of results that the general adversary bound of a function characterizes its quantum query complexity. This survey seeks to aggregate the background and definitions necessary to understand the proof. Notable…

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

A lower bound for the Gaussian Q-function is presented in the form of a single exponential function with parametric order and weight. We prove the lower bound by introducing two functions, one related to the Q-function and the other…

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

One reason why standard formulations of the central limit theorems are not applicable in high-dimensional and non-stationary regimes is the lack of a suitable limit object. Instead, suitable distributional approximations can be used, where…

The universality of the directed polymer model and the analogous KPZ equation is supported by numerical simulations using non-Gaussian random probability distributions in two, three and four dimensions. It is shown that although in the…

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

We provide an upper bound as a random variable for the functions of estimators in high dimensions. This upper bound may help establish the rate of convergence of functions in high dimensions. The upper bound random variable may converge…

We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…

In this paper, we obtain an upper bound for the Gini mean difference based on mean, variance and correlation for the case when the variables are correlated. We also derive some closed-form expressions for the Gini mean difference when the…

We address the problem of producing a lower bound for the mean of a discrete probability distribution, with known support over a finite set of real numbers, from an iid sample of that distribution. Up to a constant, this is equivalent to…

We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…

We study a mean value of the classical additive divisor problem. The main term we are interested in here is the one by Motohashi, but we also give an upper bound for the case where the main term is that of Atkinson. Furthermore, we point…