Dynamically syndetic sets and the combinatorics of syndetic, idempotent filters
Abstract
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 system. These sets are part of the highly-influential link between dynamics and combinatorics forged by Furstenberg and Weiss in the 1970's. Our main result is a characterization of dynamically central syndetic sets as precisely those sets that belong to syndetic, idempotent filters. This gives a "global" analogue to the well-known "local" characterization of Furstenberg's central sets as members of minimal, idempotent ultrafilters. Applying the main result, we answer two open questions posed by Host, Kra, and Maass concerning sets of pointwise topological recurrence.
Cite
@article{arxiv.2408.12785,
title = {Dynamically syndetic sets and the combinatorics of syndetic, idempotent filters},
author = {Daniel Glasscock and Anh N. Le},
journal= {arXiv preprint arXiv:2408.12785},
year = {2025}
}
Comments
To ease exposition, we split the original submission into two papers. The first paper is about dynamically syndetic sets and is now version 3 (and onward) of this submission. The second paper is about sets of pointwise recurrence and dynamically thick sets and will be a separate submission to the arXiv. 43 pages