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

Although adaptive optimization algorithms have been successful in many applications, there are still some mysteries in terms of convergence analysis that have not been unraveled. This paper provides a novel non-convex analysis of adaptive…

For a fixed $\theta\neq 0$, we define the twisted divisor function $$ \tau(n, \theta):=\sum_{d\mid n}d^{i\theta}\ .$$ In this article we consider the error term $\Delta(x)$ in the following asymptotic formula $$ \sum_{n\leq x}^*|\tau(n,…

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…

Let $\omega^*(n) = \{d|n: d=p-1, \mbox{$p$ is a prime}\}$. We show that, for each integer $k\geq2$, $$ \sum_{n\leq x}\omega^*(n)^k \asymp x(\log x)^{2^k-k-1}, $$ where the implied constant may depend on $k$ only. This confirms a recent…

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

This volume is a collection of six papers on the use of auxiliary information and 'a priori' values in construction of improved estimators. The work included here will be of immense application for researchers and students who emply…

We examine the size of $E_{2}(T)$, the error term in the asymptotic formula for $\int_{0}^{T} |\zeta(1/2 + it)|^{4}\, dt$ where $\zeta(s)$ is the Riemann zeta-function. We make improvements in the powers of $\log T$ in the known bounds for…

We investigate the first moment of primes in progressions $$ \sum_{\substack{q\leq x/N \\ (q,a)=1}} \Big(\psi(x; q, a) - \frac x{\varphi(q)}\Big) $$ as $x, N \to \infty$. We show unconditionally that, when $a=1$, there is a significant bias…

Let $H = N^{\theta}, \theta > 2/3$ and $k \geq 1$. We obtain estimates for the following exponential sum over primes in short intervals: \[ \sum_{N < n \leq N+H} \Lambda(n) e(g(n)), \] where $g$ is a polynomial of degree $k$. As a…

Lucas-Lehmer test is the current standard algorithm used for testing the primality of Mersenne numbers, but it may have limitations in terms of its efficiency and accuracy. Developing new algorithms or improving upon existing ones could…

Causal inference problems often involve continuous treatments, such as dose, duration, or frequency. However, identifying and estimating standard dose-response estimands requires that everyone has some chance of receiving any level of the…

An algorithm is proposed, analyzed, and tested for solving continuous nonlinear-equality-constrained optimization problems where the objective and constraint functions are defined by expectations or averages over large, finite numbers of…

In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

We improve the lower bound for $V(T)$, the number of sign changes of the error term $\psi(x)-x$ in the Prime Number Theorem in the interval $[1,T]$ for large $T$. We show that \[ \liminf_{T\to\infty}\frac{V(T)}{\log…

We consider a misspecified optimization problem that requires minimizing of a convex function $f(x;\theta^*)$ in x over a constraint set represented by $h(x;\theta^*)\leq 0$, where $\theta^*$ is an unknown (or misspecified) vector of…

In this paper, several modifications are introduced to the functional approximation method iterLap to reduce the approximation error, including stopping rule adjustment, proposal of new residual function, starting point selection for…

We explore the fundamental problem of sorting through the lens of learning-augmented algorithms, where algorithms can leverage possibly erroneous predictions to improve their efficiency. We consider two different settings: In the first…

Let $\omega^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Assuming the Elliott--Halberstam Conjecture, we prove a conjecture posted by M. R. Murty and V. K. Murty in 2021 which states that $$\sum_{n\leqslant…