Related papers: Sharper Bounds for the Chebyshev function $\theta(…

By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…

Let $R_k(x)$ denote the error incurred by approximating the number of $k$-free integers less than $x$ by $x/\zeta(k)$. It is well known that $R_k(x)=\Omega(x^{\frac{1}{2k}})$, and widely conjectured that…

We consider a sequence of composite Bernstein operators and the quadrature formulae associated with them. Upper bounds for the approximation error of continuous functions and for the approximation of integrals of continuous functions are…

Some new bounds for Cebysev functional for sequences of vectors in normed linear spaces are pointed out.

Explicit bounds on the tails of the zeta function $\zeta$ are needed for applications, notably for integrals involving $\zeta$ on vertical lines or other paths going to infinity. Here we bound weighted $L^2$ norms of tails of $\zeta$. Two…

Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…

Simple upper and lower bounds are obtained for the integral $\int_0^x\mathrm{e}^{-\gamma t}t^\nu I_\nu(t)\,\mathrm{d}t$, $x>0$, $\nu>-\frac{1}{2}$, $0<\gamma<1$. Most of our bounds for this integral are tight as $x\rightarrow\infty$. We…

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

In this paper, we find a lower bound for the order of the group $\langle \theta+\alpha\rangle \subset \overline{\mathbb F_{q}}^*$, where $\alpha\in \mathbb F_{q}$, $\theta$ is a generic root of the polynomial…

Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function $f(x)$ defined on an interval $[a,b]$ is "rounded" to a prescribed precision by constructing a…

We study the $2k$-th moment of the family of twisted modular $L$-functions to a fixed prime power modulus at the central values. We establish sharp lower bounds for all real $k \geq 0$ and sharp upper bounds for $k$ in the range $0 \leq k…

Two classical upper bounds on the Shannon capacity of graphs are the $\vartheta$-function due to Lov\'asz and the minrank parameter due to Haemers. We provide several explicit constructions of $n$-vertex graphs with a constant…

Bounds are obtained for the $L^p$ norm of the torsion function $v_{\Omega}$, i.e. the solution of $-\Delta v=1,\, v\in H_0^1(\Omega),$ in terms of the Lebesgue measure of $\Omega$ and the principal eigenvalue $\lambda_1(\Omega)$ of the…

We study the counting function of cubic function fields. Specifically, we derive an asymptotic formula for this counting function including a secondary term and an error term of order $\mathcal{O}\big(X^{2/3+\epsilon}\big)$, which matches…

It has long been known how to construct radiation boundary conditions for the time dependent wave equation. Although arguments suggesting that they are accurate have been given, it is only recently that rigorous error bounds have been…

Chebychev approximations are given for the Gamma and the Polygamma functions in only one contiguous intervall [1..inf] with a definable maximal relative error. The approximations need about three coefficients per decimal until a checked…

We improve the error terms in the Davenport-Heilbronn theorems on counting cubic fields to $O(X^{2/3 + \epsilon})$. This improves on separate and independent results of the authors and Shankar and Tsimerman. The present paper uses the…

This paper is concerned with the computable error estimates for the eigenvalue problem which is solved by the general conforming finite element methods on the general meshes. Based on the computable error estimate, we can give an…

Using the Moore--Penrose pseudoinverse, this work generalizes the gradient approximation technique called centred simplex gradient to allow sample sets containing any number of points. This approximation technique is called the…

This note provides an effective lower bound for the number of primes in the quadratic progression $p=n^2+1 \leq x$ as $x \to \infty$.