A set of 2-recurrence whose perfect squares do not form a set of measurable recurrence
Abstract
We say that S⊂ Z is a set of k-recurrence if for every measure preserving transformation T of a probability measure space (X,μ) and every A⊂eq X with μ(A)>0, there is an n∈ S such that μ(A T-n A T-2n … T-knA)>0. A set of 1-recurrence is called a set of measurable recurrence. Answering a question of Frantzikinakis, Lesigne, and Wierdl, we construct a set of 2-recurrence S with the property that \n2:n∈ S\ is not a set of measurable recurrence.
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.