相关论文: Sharper bounds for the error term in the Prime Num…

In this paper, we establish improved effective irrationality measures for certain numbers of the form $\sqrt[3]{n}$, using approximations obtained from hypergeometric functions. These results are very close to the best possible using this…

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

In this paper we present a new error bound on sampling algorithms for frequent itemsets mining. We show that the new bound is asymptotically tighter than the state-of-art bounds, i.e., given the chosen samples, for small enough error…

The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

For a real number $k$, define $\pi_k(x) = \sum_{p\le x} p^k$. When $k>0$, we prove that $$ \pi_k(x) - \pi(x^{k+1}) = \Omega_{\pm}\left(\frac{x^{\frac12+k}}{\log x} \log\log\log x\right) $$ as $x\to\infty$, and we prove a similar result when…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

A recent asymptotic expansion for the positive zeros $x=j_{\nu,m}$ ($m=1,2,3,\ldots$) of the Bessel function of the first kind $J_{\nu}(x)$ is studied, where the order $\nu$ is positive. Unlike previous well-known expansions in the…

In 1898 Charles Jean de la Valle Poussin, as part of his famed proof of the prime number theorem, developed an ineffective bound on the first Chebyshev function of the form: \[ |\theta(x)-x| = \mathcal{O}\left(x \exp(-K \sqrt{\ln…

This paper uses concepts introduced by Fiorilli and Martin to develop a more accurate remainder term in calculations of the distribution of primes in residue classes. Using it in Rubinstein and Sarnak's method estimates the limiting…

Let $f(z) = \sum_{n=1}^\infty a_f(n)q^n$ be a holomorphic cuspidal newform with even integral weight $k\geq 2$, level $N$, trivial nebentypus, and no complex multiplication (CM). For all primes $p$, we may define $\theta_p\in [0,\pi]$ such…

Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$

Let $\pi$ be a fixed Hecke--Maass cusp form for $\mathrm{SL}(3,\mathbb{Z})$ and $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be a prime. Let $L(s,\pi\otimes \chi)$ be the $L$-function associated to $\pi\otimes…

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

One of the hard optimization problems that has a semi-definite relaxation with quantitative bound on the approximation error is the maximization of a convex quadratic form on the hypercube. The relaxation not only yields an upper bound on…

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…