Arithmetical Aspects of Beurling's Real Variable Reformulation of the Riemann Hypothesis
arXiv:math/0011254
Abstract
The paper presents two arithmetical versions of the Nyman-Beurling equivalence with the Riemann hypothesis, proved by classical, quasi elementary, number-theoretic methods, based on an integrated version of the classical combinatorial identity for Moebius numbers. These proofs also give insight into the troublesome phenomenon that many natural sequences of Beurling functions tending to the indicator function of (0,1) both pointwise and in L1 norm do not converge in L2 norm.
arXiv comment21 pages
Cited by in corpus (3)
- An Algorithm to Generate Square-Free Numbers and to Compute the Moebius Function
- A Sequence of Beurling Functions Related to the Natural Approximation B_{n} Defined by an Iterative Construction Generating Square-Free Numbers k and the Value of the Mobius Function at k
- Fourier Coefficients of Beurling Functions and a Class of Mellin Transform Formally Determined by its Values on the Even Integers