On sets of pointwise recurrence and dynamically thick sets

Abstract

A set A ⊂eq N is a set of pointwise recurrence if for all minimal dynamical systems (X, T), all x ∈ X, and all open neighborhoods U ⊂eq X of x, there exists a time n ∈ A such that Tn x ∈ U. The set A is dynamically thick if the same holds for all non-empty, open sets U ⊂eq X. Our main results give combinatorial characterizations of sets of pointwise recurrence and dynamically thick sets that allow us to answer questions of Host, Kra, Maass and Glasner, Tsankov, Weiss, and Zucker. We also introduce and study a local version of dynamical thickness called dynamical piecewise syndeticity. We show that dynamically piecewise syndetic sets are piecewise syndetic, generalizing results of Dong, Glasner, Huang, Shao, Weiss, and Ye. The proofs involve the algebra of families of large sets, dynamics on the space of ultrafilters, and our recent characterization of dynamically syndetic sets.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…