Related papers: A Slight Improvement to Garaev's Sum Product Estim…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
In this short research note, we aim to establish an interesting extension of a summation due to Ramanujan.The result is derived with the help of an extension of Gauss's summation theorem available in the literature.
The idea of the restricted mean has been used to establish a significantly improved version of Markov's inequality that does not require any new assumptions. The result immediately extends on Chebyshev's inequalities and Chernoff's bound.…
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…
This paper considers Gama-Nguyen-Regev's strategy [GNR10] for optimizing pruning coefficients for lattice vector enumeration. We give a table of optimized coefficients and proposes a faster method for computing near-optimized coefficients…
The classical form of Gr\"uss' inequality, first published by G. Gr\"{u}ss in 1935, gives an estimate of the difference between the integral of the product and the product of the integrals of two functions. In the subsequent years, many…
This note provides truncated formulae with explicit error terms to compute Euler products over primes in arithmetic progressions of rational fractions. It further provides such a formula for the product of terms of the shape $F(1/p, 1/p^s)$…
In this article, we obtain two interesting general inequalities concerning Riemman sums of convex functions, which in particular, sharpen Alzer's inequality and give a suitable converse for it.
For absolutely convergent series we state explicitly a one-sided summation estimate that can be viewed as the discrete analogue of the change of variable formula on the half line. This estimate is implicit in Pascal Lef\`evre's recent…
In this paper, we obtain sharp estimates for the number of lattice points under and near the dilation of a general parabola, the former generalizing an old result of Popov. We apply Vaaler's lemma and the Erd\H{o}s-Turan inequality to…
We improve the classical discrete Hardy inequality \begin{equation*}\label{1} \sum _{{n=1}}^{\infty }a_{n}^{2}\geq \left({\frac {1}{2}}\right)^{2} \sum _{{n=1}}^{\infty }\left({\frac {a_{1}+a_{2}+\cdots +a_{n}}{n}}\right)^{2},…
We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.
We give a generalization of the Shestakov-Umirbaev inequality which plays an important role in their solution of the tame generators conjecture.
We prove variational forms of the Barban-Davenport-Halberstam Theorem and the large sieve inequality. We apply our result to prove an estimate for the sum of the squares of prime differences, averaged over arithmetic progressions.
Estimation of value in policy gradient methods is a fundamental problem. Generalized Advantage Estimation (GAE) is an exponentially-weighted estimator of an advantage function similar to $\lambda$-return. It substantially reduces the…
Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
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…
We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…
We give necessary and sufficient conditions for the Chebyshev inequality to be an equality.