Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lacunary Fourier and Walsh-Fourier series near L^1 (1304.3943v2)

Published 14 Apr 2013 in math.CA

Abstract: We prove that, for functions in the Orlicz class LloglogLloglogloglogL, lacunary subsequences of the Fourier and the Walsh-Fourier series converge almost everywhere. Our integrability condition is less stringent than the homologous assumption in the almost everywhere convergence theorems of Lie (Fourier case) and Do-Lacey (Walsh-Fourier case), where the quadruple logarithmic term is replaced by a triple logarithm. Our proof of the Walsh-Fourier case is self-contained and, in antithesis to Do and Lacey's argument, avoids the use of Antonov's lemma, arguing directly via novel weak-Lp bounds for the Walsh-Carleson operator.

Summary

We haven't generated a summary for this paper yet.