2000 character limit reached
A set of 2-recurrence whose perfect squares do not form a set of measurable recurrence
Published 24 Jul 2022 in math.DS and math.CO | (2207.11851v2)
Abstract: We say that $S\subset\mathbb Z$ is a set of $k$-recurrence if for every measure preserving transformation $T$ of a probability measure space $(X,\mu)$ and every $A\subseteq X$ with $\mu(A)>0$, there is an $n\in S$ such that $\mu(A\cap T{-n} A\cap T{-2n}\cap \dots \cap T{-kn}A)>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\in S}$ is not a set of measurable recurrence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.