Related papers: Improving an inequality for the divisor function
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 investigate the behavior of the divisor function in both short intervals and in arithmetic progressions. The latter problem was recently studied by \'E. Fouvry, S. Ganguly, E. Kowalski, and Ph. Michel. We prove a complementary result to…
We obtain an improvement of the Beckner's inequality $\| f\|^{2}_{2} -\|f\|^{2}_{p} \leq (2-p) \| \nabla f\|_{2}^{2}$ valid for $p \in [1,2]$ and the Gaussian measure. Our improvement is essential for the intermediate case $p \in (1,2)$,…
New unconditional estimates of the divisor and totient functions are contributed to the literature. These results are consistent with the Riemann hypothesis and seem to solve the Nicolas inequality for all sufficiently large integers.
We show that an almost trivial inequality for the first and second mean of a random variable can be used to give non-trivial improvements on deep results. As applications we improve on results on lower bounds for the Riemann zeta-function…
We prove an averaged version of a claim suspected to be true by Alladi, Erd\"os, and Vaaler. Qualitatively, the result states that a divisor sum of a multiplicative function, which obeys certain size constraints, derives most of its value…
Using Bombieri-Iwaniec method, we establish an improvement on both Gauss's Circle Problem and Dirichlet's Divisor Problem. More precisely, we derive a new estimate for the first spacing problem and combine it with Huxley's results on the…
In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.
Certain smoothing inequalities were proposed in the recent paper posted on arXiv at arxiv:1301.2828 in order to lessen the very large gap between the best correctly established upper and lower bounds on the constant factor in the nonuniform…
Based on a new idea of factorization, we prove an improved discrete Rellich inequality and discuss its optimality. We also give a conjecture on improved higher order discrete Hardy-like inequalities and formulate an open problem for the…
The goal of this note is to present a modification of the popular median of means estimator that achieves sub-Gaussian deviation bounds with nearly optimal constants under minimal assumptions on the underlying distribution. We build on a…
We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading constant in the P\'{o}lya-Vinogradov inequality. Towards…
We present a refinement, by selfimprovement, of the arithmetic geometric inequality.
We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a…
By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation…
In this note we present a refinement of the AM-GM inequality, and then we estimate in a special case the typical size of the improvement.
In this paper, new improvement of celebrated H\"older inequality by means of isotonic linear functionals is established. An important feature of the new inequality obtained in here is that many existing inequalities related to the H\"older…
Simple inequalities are established for some integrals involving the modified Bessel functions of the first and second kind. In most cases, we show that we obtain the best possible constant or that our bounds are tight in certain limits. We…
Motivated by previous work leveraging factorizations of second- and fourth-order differential operators, a general integral inequality involving higher order derivatives is proven by elementary means. It is then shown how this framework…
An error bound for Gaussian Interpolation which is better than the current exponential-type error bound is presented.