Search arXivSearch

arXiv · 2511.02080

A structure theorem for polynomial return-time sets in minimal systems

Abstract

We investigate the structure of return-time sets determined by orbits along polynomial tuples in minimal topological dynamical systems. Building on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye, we prove a structure theorem showing that, in a minimal system, return-time sets coincide -- up to a non-piecewise syndetic set -- with those in its maximal infinite-step pronilfactor. As applications, we establish three new multiple recurrence theorems concerning linear recurrence along dynamically defined syndetic sets and polynomial recurrence along arithmetic progressions in minimal and totally minimal systems. We also show how our main theorem can be used to prove that two previously separate conjectures -- one due to Glasner, Huang, Shao, Weiss, and Ye and the other due to Leibman -- are equivalent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Glasscock, Andreas Koutsogiannis, Anh N. Le, Joel Moreira, Florian K. Richter, Donald Robertson. 2026-05-12. A structure theorem for polynomial return-time sets in minimal systems. https://arxiv.org/abs/2511.02080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS