A Sequence of Beurling Functions Related to the Natural Approximation Bn Defined by an Iterative Construction Generating Square-Free Numbers k and the Value of the Mobius Function at k

Abstract

We construct iteratively a sequence of numbers kn and Beurling functions An converging pointwise to -1 in [0,1]. We prove results which seems to suggest that each An is equal to a well known approximating sequence of functions denoted in literature by Bn; see ref. [2]. We conjecture that a sufficient condition for this equality is that the set of the kn's be equal to the set of square-free numbers. Numerical evidence seems to support both conjectures. Anyway, we think that these sequences are interesting by itself because our construction not only generates square-free (hence prime) numbers k, but also the value of the Mobius function at k. Our definition is independent of the square-free numbers and the Mobius function, with the ki's arising as discontinuity points of the Ai's. As for the case of Bn, we prove that sequence An is not convergent to -1 in L2([0,1],dx). Consequently, we focus our analysis not on L2 norm analysis but other integral properties. This procedure seems to be useful to elucidate the lack of L2 convergence for step Beurling functions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…