Some examples of well-behaved Beurling number systems
Frederik Broucke, Gregory Debruyne, Szil\'ard R\'ev\'esz

TL;DR
This paper explores the existence of well-behaved Beurling number systems with specific power savings in their counting functions, including constructions under the Riemann hypothesis.
Contribution
It demonstrates the existence of $[eta,eta]$-systems for various $eta$ and constructs special systems assuming the Riemann hypothesis.
Findings
Existence of $[eta,eta]$-systems for $eta o 1$
Construction of systems with $eta<1/2$ under Riemann hypothesis
Systems satisfy $ ext{max}\{ ext{alpha}, ext{beta}\} o 1/2$
Abstract
We investigate the existence of well-behaved Beurling number systems, which are systems of Beurling generalized primes and integers which admit a power saving in the error term of both their prime and integer-counting function. Concretely, we search for so-called -systems, where and are connected to the optimal power saving in the prime and integer-counting functions. It is known that every -system satisfies . In this paper we show there are -systems for each and . Assuming the Riemann hypothesis, we also construct certain families of -systems with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Analytic Number Theory Research · History and Theory of Mathematics
