Talk page
Title:
Examples of well-behaved Beurling number systems
Speaker:
Abstract:
A Beurling number system consists a non-decreasing unbounded sequence of reals larger than 1, which are called generalized primes, and the sequence of all possible products of these generalized primes, which are called generalized integers. With both sequences one associates counting functions. Of particular interest is the case when both counting functions are close to their classical counter parts: namely when the prime-counting function is close to Li(x), and when the integer-counting function is close to ax for some positive constant a.
A Beurling number systems is well-behaved if it admits a power saving in the error terms for both these counting functions. In this talk, I will discuss some general theory of these well-behaved systems, and present some recent work about examples of such well-behaved number systems. This talk is based on joint work with Gregory Debruyne and Szilárd Révész.
Link:
Workshop: