Poisson generic sequences

2022/02/03 by Nicolás Álvarez, Álvarez, Nicolás, Verónica Becher +3 · 1 citation
Computer Science · Mathematics · #11K16 #11K55 #60G55 #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2202.01632

openalex publication_date 2022/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Years ago, Zeev Rudnick defined the Poisson generic real numbers by counting the number of occurrences of long blocks of digits in the initial segments of the expansions of the real numbers in a fixed integer base. Peres and Weiss proved that almost all real numbers, with respect to Lebesgue measure, are Poisson generic, but they did not publish their proof. In this note first we transcribe Peres and Weiss' proof and then we show that there are computable Poisson generic instances and that all Martin-Löf random real numbers are Poisson generic.

Cited by

• A Normality Conjecture on Rational Base Number Systems

Related

• Poisson genericity in numeration systems with exponentially mixing probabilities
• The descriptive complexity of the set of Poisson generic numbers
• Combinatorial and number-theoretic properties of generic reals
• On the central role of the scale invariant Poisson processes on\n (0,infty)
• Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling