Quantitative multiple recurrence for two and three transformations
Abstract
We provide various counter examples for quantitative multiple recurrence problems for systems with more than one transformation. We show that There exists an ergodic system (X,X,μ,T1,T2) with two commuting transformations such that for every 0<< 4, there exists A∈X such that μ(A T1-nA T2-nA)<μ(A) for every n≠ 0; There exists an ergodic system (X,X,μ,T1,T2, T3) with three commuting transformations such that for every >0, there exists A∈X such that μ(A T1-nA T2-nA T3-nA)<μ(A) for every n≠ 0; There exists an ergodic system (X,X,μ,T1,T2) with two transformations generating a 2-step nilpotent group such that for every >0, there exists A∈X such that μ(A T1-nA T2-nA)<μ(A) for every n≠ 0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.