Related papers: New bounds in R.S. Lehman's estimates for the diff…

M-estimators are ubiquitous in machine learning and statistical learning theory. They are used both for defining prediction strategies and for evaluating their precision. In this paper, we propose the first non-asymptotic "any-time"…

A new risk bound is presented for the problem of convex/concave function estimation, using the least squares estimator. The best known risk bound, as had appeared in \citet{GSvex}, scaled like $\log(en) n^{-4/5}$ under the mean squared…

This article provides a proof that the Ramanujan's Inequality given by, $$\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$$ holds unconditionally for every $x\geq \exp(43.5102147)$. In case for an alternate proof of the result stated…

We derive new upper and lower bounds for probabilities that $r$ or at least $r$ from $n$ events occur. These bounds can turn to equalities. The method is discussed as well. It works for measurable space and measures with sign, too. We also…

Assuming the Generalized Riemann Hypothesis, we provide uniform upper and lower bounds with explicit main terms for $\log{\left|\cL(s)\right|}$ for $\sigma \in (1/2,1)$ and for functions in the Selberg class. In particular, we focus on the…

We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…

We propose a new estimator, the thresholded scaled Lasso, in high dimensional threshold regressions. First, we establish an upper bound on the $\ell_\infty$ estimation error of the scaled Lasso estimator of Lee et al. (2012). This is a…

We consider the problem of quickest changepoint detection under the Average Run Length (ARL) constraint where the pre-change and post-change laws lie in composite families $\mathscr{P}$ and $\mathscr{Q}$ respectively. In such a problem, a…

Assuming the Generalized Riemann Hypothesis, we provide uniform upper bounds with explicit main terms for moduli of $\left(\cL'/\cL\right)(s)$ and $\log{\cL(s)}$ for $1/2+\delta\leq\sigma<1$, fixed $\delta\in(0,1/2)$ and for functions in…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval $[u+1,u+h]$ of Legendre symbols modulo primes $p$ in a dyadic interval $[Q,2Q]$. The bound is nontrivial and gives a power…

For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n)$ of the finite arithmetic progression $\{u_k:=u_0+kr\}_{k=0}^n$. We derive new lower bounds on $L_n$ which…

We improve the upper bound of the following inequalities for the gamma function $\Gamma$ due to H. Alzer and the author. \begin{equation*}…

Conditionally on the Riemann Hypothesis we obtain bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta-function for all positive real k < 2.181. This provides for the first time an upper bound of the correct…

We report the finding of the new upper bound on the lowest positive integer $x$ for which the Mertens conjecture \begin{equation*} \left| \sum_{1 \leq n \leq x} \mu(n) \right| < \sqrt{x} \end{equation*} fails to hold: $x < \exp(1.017 \times…

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…

Taking $r>0$, let $\pi_{2r}(x)$ denote the number of prime pairs $(p, p+2r)$ with $p\le x$. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that $\pi_{2r}(x)\sim 2C_{2r} {\rm li}_2(x)$ with an explicit constant $C_{2r}>0$.…

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…