Search arXivSearch

arXiv · 2509.13697

Coarse non-wandering sets and their filtration

Abstract

This paper investigates recurrence properties of dynamical systems under the restriction that control is available only through inputs and outputs. We introduce the concept of ``coarse non-wandering'', a generalization of the classical non-wandering concept, and construct an associated filtration based on levels that quantify the closeness of recurrence behavior under input/output-only control. The forward direction of this filtration describes how the level of control relates to recurrence properties, whereas the backward direction captures the robustness of such behaviors and, in particular, guarantees controllability through control applied only at the observation points when the observational noise is sufficiently small. Furthermore, we demonstrate that the existence of a wandering domain is equivalent to the presence of an orbit reachable within finite error but unable to return within any slightly enlarged error bound.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomoo Yokoyama. 2025-09-17. Coarse non-wandering sets and their filtration. https://arxiv.org/abs/2509.13697

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