An L1 counting problem in ergodic theory
Abstract
We solve the following counting problem for measure preserving transformations. For f∈ L+1(μ), is it true that nn(f)(x)n <∞, where n(f)(x)= # k: f(Tk x)k> 1 n? One of the consequences is the nonvalidity of J. Bourgain's Return Time Theorem for pairs of (L1, L1) 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.