Anh N. Le

collaborators

3 papers

math.DS2026

On sets of pointwise recurrence and dynamically thick sets

Daniel Glasscock, Anh N. Le

A set $A \subseteq 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$ , the…

math.DS2025

On subshifts with low maximal pattern complexity

Anh N. Le, Ronnie Pavlov, Casey Schlortt

For a finite alphabet $A$ and a sequence $x \in A^{N}$ , Kamae and Zamboni defined the maximal pattern complexity function $p_{x}^{*} (n)$ as a natural gener…

math.DS2025

Dynamically syndetic sets and the combinatorics of syndetic, idempotent filters

Daniel Glasscock, Anh N. Le

A subset of the positive integers is dynamically central syndetic if it contains the times that a point returns to a neighborhood of itself in a minimal topological dynamical syste…