Related papers: A new bound for the smallest $x$ with $\pi(x) > li…

Ramanujan proved that the inequality $\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$ holds for all sufficiently large values of $x$. Using an explicit estimate for the error in the prime number theorem, we show unconditionally that…

The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…

Assuming the Generalized Riemann Hypothesis, the non-trivial zeros of $L$-functions lie on the critical line with the real part $1/2$. We find an upper bound of the lowest first zero in families of even cuspidal newforms of prime level…

In 1927, Artin conjectured that any integer other than -1 or a perfect square generates the multiplicative group $\mathbb{Z}/p\mathbb{Z}^\times$ for infinitely many $p$. In \cite{MoSt}, Moree and Stevenhagen considered a two-variable…

Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…

In this paper we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known. In particular, we address the case where…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…

We consider the number of zeros of holomorphic functions in a bounded domain that depend on a small parameter and satisfy an exponential upper bound near the boundary of the domain and similar lower bounds at finitely many points along the…

The Lipschitz differential equation, $\dot x=f(x)$, in spaces $X \in C^n$ and $X \in R^n$ is considered. The minimal period problem is to find the exact lower bound for peri-ods of non-constant solutions, expressed in the Lipschitz constant…

We revisit Pavlov's characterization for Riesz bases of exponentials and study the corresponding lower Riesz basis bounds. In particular, this approach allows us to improve on known estimates for the bounds in Avdonin's theorem regarding…

We study lower bounds for the Riemann zeta function $\zeta(s)$ along vertical arithmetic progressions in the right-half of the critical strip. We show that the lower bounds obtained in the discrete case coincide, up to the constants in the…

We show that the generalized Riemann hypothesis implies that there are infinitely many consecutive zeros of the Riemann zeta function whose spacing is 2.9125 times larger than the average spacing. This is deduced from the calculation of the…

We correct claims about lower bounds on mutual information (MI) between real-valued random variables made in A. Kraskov {\it et al.}, Phys. Rev. E {\bf 69}, 066138 (2004). We show that non-trivial lower bounds on MI in terms of linear…

We establish why li(x) outperforms x/log x as an estimate for the prime counting function pi(x). The result follows from subdividing the natural numbers into the intervals s_k :={p_k^2,..., p_{k+1}^2-1}, k>=1, each being fully sieved by the…

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…

The set of Salem numbers is proved to be bounded from below by $\theta_{31}^{-1}= 1.08544\ldots$ where $\theta_{n}$, $ n \geq 2$, is the unique root in $(0,1)$ of the trinomial $-1+x+x^n$. Lehmer's number $1.176280\ldots$ belongs to the…

In certain applications involving the solution of a Bayesian inverse problem, it may not be possible or desirable to evaluate the full posterior, e.g. due to the high computational cost of doing so. This problem motivates the use of…

Assuming the generalized Lindel\"of hypothesis for Dirichlet $L$-functions, we establish that the least prime $p\equiv a\pmod{q}$ satisfies $p\ll_{\varepsilon} q^{2+\varepsilon}$. This achieves a bound that nearly matches the classical…

Assuming the Riemann Hypothesis, we show that infinitely often consecutive non-trivial zeros of the Riemann zeta-function differ by at least 2.7327 times the average spacing and infinitely often they differ by at most 0.5154 times the…

This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…