English
Related papers

Related papers: Chebyshev Estimates for Beurling Generalized Prime…

200 papers

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp…

Number Theory · Mathematics 2020-12-29 Connor Paul Wilson

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…

Number Theory · Mathematics 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

Assuming the Generalized Riemann Hypothesis, we provide uniform upper bounds with explicit main terms for moduli of $\left(\cL'/\cL\right)(s)$ and $\log{\cL(s)}$ for $1/2+\delta\leq\sigma<1$, fixed $\delta\in(0,1/2)$ and for functions in…

Number Theory · Mathematics 2024-08-15 Neea Palojärvi , Aleksander Simonič

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

General Mathematics · Mathematics 2023-02-24 Junda Pan

For a set of primes $\mathcal{P}$, let $\Psi(x, \mathcal{P})$ be the number of positive integers $n \leq x$ all of whose prime factors lie in $\mathcal{P}$. In this paper we classify the sets of primes $\mathcal{P}$ such that $\Psi(x,…

Number Theory · Mathematics 2015-09-09 Kaisa Matomäki , Xuancheng Shao

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

Probability · Mathematics 2011-10-11 Yuri Kifer

We study the prime numbers that lie in Beatty sequences of the form $\lfloor \alpha n + \beta \rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev…

Number Theory · Mathematics 2019-09-04 Caleb Ji , Joshua Kazdan , Vaughan McDonald

Solomonoff's uncomputable universal prediction scheme $\xi$ allows to predict the next symbol $x_k$ of a sequence $x_1...x_{k-1}$ for any Turing computable, but otherwise unknown, probabilistic environment $\mu$. This scheme will be…

Machine Learning · Computer Science 2007-05-23 Marcus Hutter

Some new sufficient conditions for the weighted Chebyshev's inequality for real numbers to hold are provided.

Classical Analysis and ODEs · Mathematics 2007-05-23 Sever Silvestru Dragomir

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

Number Theory · Mathematics 2026-05-20 Michael Harm

We introduce a strategy to tackle some known obstructions of current approaches to the Fourier uniformity conjecture. Assuming GRH, we then show the conjecture holds for intervals of length at least $(\log X)^{\psi(X)}$, with $\psi(X)…

Number Theory · Mathematics 2023-10-13 Miguel N. Walsh

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Number Theory · Mathematics 2025-06-17 Matt Visser

In this paper we give new estimates for integrals involving some arithmetic functions defined over prime numbers. The main focus here is on the prime counting function $\pi(x)$ and the Chebyshev $\vartheta$-function. Some of these estimates…

Number Theory · Mathematics 2022-03-18 Christian Axler

In 1969 V.V.~Petrov found a new sufficient condition for the applicability of the strong law of large numbers to sequences of independent random variables. He proved the following theorem: let $\{X_{n}\}_{n=1}^{\infty}$ be a sequence of…

Probability · Mathematics 2014-08-19 Valery Korchevsky

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

Number Theory · Mathematics 2017-09-29 Maciej Grzeskowiak

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Number Theory · Mathematics 2022-02-08 Anne-Maria Ernvall-Hytönen , Neea Palojärvi

In this paper, we study the ill-posedness issue for the generalized improved Boussinesq equation. In particular we prove there is norm inflation with infinite loss of regularity at general initial data in $\langle \nabla…

Analysis of PDEs · Mathematics 2023-06-27 Pierre de Roubin

We make explicit Bombieri's refinement of Gallagher's log-free "large sieve density estimate near $\sigma = 1$" for Dirichlet $L$-functions. We use this estimate and recent work of Green to prove that if $N\geq 2$ is an integer,…

Number Theory · Mathematics 2025-01-07 Jesse Thorner , Asif Zaman

We show the zero-density estimate \[ N(\zeta_{\mathcal{P}}; \alpha, T) \ll T^{\frac{4(1-\alpha)}{3-2\alpha-\theta}}(\log T)^{9} \] for Beurling zeta functions $\zeta_{\mathcal{P}}$ attached to Beurling generalized number systems with…

Number Theory · Mathematics 2024-09-17 Frederik Broucke

It is proved that any continuous function f on the unit circle such that the sequence e^{in f}, n=1,2,... has small Wiener norm \| e^{in f} \|_A = o (\frac{\log^{1/22} |n|}{(\log \log |n|)^{3/11}}), is linear. Moreover, we get lower bounds…

Classical Analysis and ODEs · Mathematics 2014-01-20 Sergei V. Konyagin , Ilya D. Shkredov