Hostname: page-component-76d6cb85b7-hqrjx Total loading time: 0 Render date: 2026-07-12T17:47:47.361Z Has data issue: false hasContentIssue false

Limit theorems for a class of unbounded observables with an application to ‘Sampling the Lindelöf hypothesis’

Published online by Cambridge University Press:  12 August 2025

KASUN FERNANDO
Affiliation:
Department of Mathematics, Brunel University London, Uxbridge, UK (e-mail: kasun.fernando@brunel.ac.uk)
TANJA I. SCHINDLER*
Affiliation:
Faculty of Mathematics and Computer Science, Jagiellonian University in Krakow, Kraków, Poland Department of Mathematics and Statistics, University of Exeter, Exeter, UK
Rights & Permissions [Opens in a new window]

Abstract

We prove the central limit theorem (CLT), the first-order Edgeworth expansion and a mixing local central limit theorem (MLCLT) for Birkhoff sums of a class of unbounded heavily oscillating observables over a family of full-branch piecewise $C^2$ expanding maps of the interval. As a corollary, we obtain the corresponding results for Boolean-type transformations on $\mathbb {R}$. The class of observables in the CLT and the MLCLT on $\mathbb {R}$ include the real part, the imaginary part and the absolute value of the Riemann zeta function. Thus obtained CLT and MLCLT for the Riemann zeta function are in the spirit of the results of Lifschitz & Weber [Sampling the Lindelöf hypothesis with the Cauchy random walk. Proc. Lond. Math. Soc. (3) 98 (2009), 241–270] and Steuding [Sampling the Lindelöf hypothesis with an ergodic transformation. RIMS Kôkyûroku Bessatsu B34 (2012), 361–381] who have proven the strong law of large numbers for sampling the Lindelöf hypothesis.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press