Integer counts and zeros in Beurling number systems

A Beurling system starts with generalized primes. Their finite products form generalized integers, counted with multiplicity. If the number of generalized integers up to x stays very close to x, must the associated zeta function have a half-plane near ℜs=1\Re s = 1 with no zeros?

Why it matters and what counts as progress

Why it matters: Counting integers and locating zeta zeros express different information about a prime system. A counterexample shows how much the count alone can imply about its zeros.

What counts as progress: Construct a discrete system with a smaller counting error and zeros approaching ℜs=1\Re s = 1, or prove a zero-free region from explicit assumptions. Distinguish statements about generalized systems from those about ordinary primes.

How the problem developed

  1. 2025 · Power savings for Beurling counts [1]

    Frederik Broucke, Gregory Debruyne and Szilárd Gy. Révész Frederik Broucke, Gregory Debruyne and Szilárd Gy. Révész study simultaneous power savings in the prime and integer counts of Beurling systems.

  2. 2 Nov 2026 · A single system with sub-power error [2]

    Samuel Lavery with AI assistance Samuel Lavery’s project presents a discrete system with error below every positive power and zeta zeros approaching ℜs=1\Re s = 1, with a stated short-interval premise.

AI contribution

Discrete Beurling number systems with integer error below every power of x and no zero-free half-plane

Samuel Lavery

Assuming the specified short-interval prime estimate for ordinary primes, there is a discrete Beurling number system with generalized integer count x+O(xε)x + O(x^{\varepsilon }) for every ε>0\varepsilon > 0 whose zeta function has no zero-free half-plane of the form ℜs>1−δ\Re s > 1-\delta for any δ>0\delta > 0.

AI involvementAI-led
ImportanceNotable
Technical verificationFormal (Lean)
Human understandingFew
Paper date:

Sources

  1. Broucke, Debruyne and Révész on Beurling counting errors
  2. Discrete Beurling number systems with integer error below every power of x and no zero-free half-plane
  3. Pinned theorem, provenance and checking record
  4. Heath-Brown’s short-interval prime estimate
  5. Author’s disclosure and revision chronology
Publication history