Algorithmic randomness in harmonic analysis

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Johanna N. Y. Franklin, Lucas Rodríguez, Diego A. Rojas
DOI: 10.48550/arxiv.2601.03239
Cited by: 0

Abstract

Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute characterized Schnorr randomness using an effective version of Carleson's Theorem. We show here that, for computable $1

Fields of Study & Subjects

Advanced Banach Space Theory Mathematical Dynamics and Fractals Computability Logic AI Algorithms

Publication details

Journal / source
arXiv (Cornell University)
Publication date
6 January 2026
Document type
Preprint