Related papers: Updating the error term in the prime number theore…

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

We compare results from $\delta$--expansion, in simple theories, with self--consistent calculations as well as calculations involving the principle of minimal sensitivity. We show that the latter methods give relatively more accurate…

Learning-to-optimize leverages machine learning to accelerate optimization algorithms. While empirical results show tremendous improvements compared to classical optimization algorithms, theoretical guarantees are mostly lacking, such that…

An optimal 3-point quadrature formula of closed type is derived. Various error inequalities are established. Applications in numerical integration are also given.

We introduce \textit{basic inequalities} for first-order iterative optimization algorithms, forming a simple and versatile framework that connects implicit and explicit regularization. While related inequalities appear in the literature, we…

We obtain an asymptotic formula for the number of primes $p\leq x_1$, $p\leq x_2$ such that $p_1(p_2+a)\equiv l \pmod q$ with $(a,q)=(l,q)=1$, $q\leq x^{\kappa_0}$, $x_1\geq x^{1-\alpha}$, $x_2\geq x^{\alpha}$, $$…

Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint…

We give a generalized and effective version of Bekehermes' improvement of Newman's Tauberian theorem. To do so we prove an effective version of the Riemann-Lebesgue Lemma for functions of bounded $p$-variation. We apply our Tauberian…

Classically, the time complexity of a first-order method is estimated by its number of gradient computations. In this paper, we study a more refined complexity by taking into account the `lingering' of gradients: once a gradient is computed…

For a prime number $p$, let $A_3(p)= | \{ m \in \mathbb{N}: \exists m_1,m_2,m_3 \in \mathbb{N}, \frac{m}{p}=\frac{1}{m_1}+\frac{1}{m_2}+\frac{1}{m_3} \} |$. In 2019 Luca and Pappalardi proved that $x (\log x)^3 \ll \sum_{p \le x} A_{3}(p)…

A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

We provide explicit upper bounds of the order $\log t/\log\log t$ for $|\zeta'(s)/\zeta(s)|$ and $|1/\zeta(s)|$ when $\sigma$ is close to $1$. These improve existing bounds for $\zeta(s)$ on the $1$-line.

We establish an essentially optimal estimate for the ninth moment of the exponential sum having argument $\alpha x^3+\beta x$. The first substantial advance in this topic for over 60 years, this leads to improvements in Heath-Brown's…

Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.

This is an article for a general mathematical audience on the author's work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. It is based on several one hour lectures, chiefly given at…

For $i\in \{1,2,3\}$, let $E_i(x)$ denote the error term in each of the three theorems of Mertens on the asymptotic distribution of prime numbers. We show that for $i\in \{1,2\}$ the Riemann hypothesis is equivalent to the condition…

We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…

In estimation a parameter $\theta\in{\mathbb R}$ from a sample $(x_1,\ldots,x_n)$ from a population $P_{\theta}$ a simple way of incorporating a new observation $x_{n+1}$ into an estimator $\tilde\theta_{n} =…