Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-05T16:28:15.972Z Has data issue: false hasContentIssue false

On sets of pointwise recurrence and dynamically thick sets

Published online by Cambridge University Press:  30 July 2026

DANIEL GLASSCOCK*
Affiliation:
University of Massachusetts Lowell, USA
ANH N. LE
Affiliation:
University of Denver, USA (e-mail: anh.n.le@du.edu)
Rights & Permissions [Opens in a new window]

Abstract

A set $A \subseteq \mathbb {N}$ is a set of pointwise recurrence if for all minimal dynamical systems $(X, T)$, all $x \in X$, and all open neighborhoods $U \subseteq X$ of x, there exists a time $n \in A$ such that $T^n x \in U$. The set A is dynamically thick if the same holds for all non-empty, open sets $U \subseteq 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, and Maass [Variations on topological recurrence. Monatsh. Math. 179(1) (2016), 57–89] and Glasner, Tsankov, Weiss, and Zucker [Bernoulli disjointness. Duke Math. J. 170(4) (2021), 615–651]. 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 Glasner and Weiss [Interpolation sets for subalgebras of $l^\infty(\mathbb{Z})$. Israel J. Math. 44(4) (1983), 345–360], Huang and Ye [Dynamical systems disjoint from any minimal system. Trans. Amer. Math. Soc. 357(2) (2005), 669–694], and Dong, Shao, and Ye [Product recurrent properties, disjointness and weak disjointness. Israel J. Math. 188 (2012), 463–507]. The proofs involve the algebra of families of large sets, dynamics on the space of ultrafilters, and our recent characterization of dynamically syndetic sets.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press
Figure 0

Figure 1 Containment among the families appearing in this paper. An arrow F→G$\mathscr {F} \to \mathscr {G}$ indicates that F⊊G$\mathscr {F} \subsetneq \mathscr {G}$. There are eight families and their duals, yielding sixteen families in all, two pairs of which coincide. The diagram’s symmetry is explained by the family duality described in §2.1.1.