Related papers: Sharper bounds for the Chebyshev function $\psi(x)…

The challenge to measure exposures regularly forces financial institutions into a choice between an overwhelming computational burden or oversimplification of risk. To resolve this unsettling dilemma, we systematically investigate replacing…

We build a new estimate for the normalized eigenfunctions of the operator $-\partial_{xx}+\mathcal V(x)$ based on the oscillatory integrals and Langer's turning point method, where $\mathcal V(x)\sim |x|^{2\ell}$ at infinity with $\ell>1$.…

We derive a stronger uniqueness result if a function with compact support and its truncated Hilbert transform are known on the same interval by using the Sokhotski-Plemelj formulas. To find a function from its truncated Hilbert transform,…

In this paper, we present explicit and computable error bounds for the asymptotic expansions of the Hermite polynomials with Plancherel--Rotach scale. Three cases, depending on whether the scaled variable lies in the outer or oscillatory…

We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…

Let $\pi$ be a $SL(3,\mathbb Z)$ Hecke-Maass cusp form, and let $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be prime. In this note we revisit the subconvexity problem addressed in `The circle method and bounds…

In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…

We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximating a problem beyond a certain threshold requires…

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

We show that, for almost all $x$, the interval $(x, x+(\log x)^{2.1}]$ contains products of exactly two primes. This improves on a work of the second author that had $3.51$ in place of $2.1$. To obtain this improvement, we prove a new type…

In this paper we discuss the generalizations of the concept of Chebyshev's bias from two perspectives. First we give a general framework for the study of prime number races and Chebyshev's bias attached to general $L$-functions satisfying…

Prior work (Klochkov $\&$ Zhivotovskiy, 2021) establishes at most $O\left(\log (n)/n\right)$ excess risk bounds via algorithmic stability for strongly-convex learners with high probability. We show that under the similar common assumptions…

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…

Let $x\ge 2$. The $\psi$-form of the prime number theorem is $\psi(x) =\sum\sb{n \le x}\Lambda(n) =x +O\bigl(x\sp{1-H(x)} \log\sp{2} x\big)$, where $H(x)$ is a certain function of $x$ with $0< H(x) \le \tfrac{1}{2}$. Tur\'an proved in 1950…

We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…

We prove that $|\zeta(\sigma+it)|\le 70.7 |t|^{4.438 (1-\sigma)^{3/2}}\log^{2/3}|t|$ for $1/2\le\sigma\le 1$ and $|t|\ge 3$. As a consequence, we improve the explicit zero-free region for $\zeta(s)$, showing that $\zeta(\sigma+it)$ has no…

We seek to derive the probability--expressed in terms of the Hilbert-Schmidt (Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres-Horodecki test on the…

We present an accelerated gradient method for non-convex optimization problems with Lipschitz continuous first and second derivatives. The method requires time $O(\epsilon^{-7/4} \log(1/ \epsilon) )$ to find an $\epsilon$-stationary point,…

This paper deals with coefficient estimates for close-to-convex functions with argument $\beta$ ($-\pi/2<\beta<\pi/2$). By using Herglotz representation formula, sharp bounds of coefficients are obtained. In particluar, we solve the problem…