M(x) = o(x) estimates for Beurling numbers
From MaRDI portal
Publication:5223350
Abstract: In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not an unconditional consequence of the PNT. Here we give two conditions that yield the Beurling version of the bound, and examples illustrating failures when these conditions are not satisfied.
Recommendations
Cites work
- scientific article; zbMATH DE number 1532354 (Why is no real title available?)
- scientific article; zbMATH DE number 2120371 (Why is no real title available?)
- scientific article; zbMATH DE number 3343753 (Why is no real title available?)
- scientific article; zbMATH DE number 3081798 (Why is no real title available?)
- A generalization of Halász's theorem to Beurling's generalized integers and its application
- A set of generalized numbers showing Beurling's theorem to be sharp
- Beurling generalized numbers
- Multiplicative number theory. I. Classical theory
- On PNT equivalences for Beurling numbers
- On Two Conjectures in the Theory of Numbers
- Optimal Tauberian constant in Ingham's theorem for Laplace transforms
- Some examples in the theory of Beurling's generalized prime numbers
- Tauberian Theory
- Topics in multiplicative number theory
Cited in
(13)- The average order of the Möbius function for Beurling primes
- Beurling numbers whose number of prime factors lies in a specified residue class
- Prime number theorem equivalences and non-equivalences
- Chebyshev upper estimates for Beurling's generalized prime numbers
- Halász's theorem for Beurling generalized numbers
- On the missing \(\log\) factor
- On zero-density estimates and the PNT in short intervals for Beurling generalized numbers
- On Diamond's \(L^1\) criterion for asymptotic density of Beurling generalized integers
- Halász's theorem for Beurling numbers
- Constructive elementary estimates for M(x)
- On Mertens' theorem for Beurling primes
- Comparing the prime number theorem and the sum of the Moebius function
- Multiplicative functions with sum zero over Beurling generalized prime number systems
This page was built for publication: \(M(x) = o(x)\) estimates for Beurling numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223350)