Abstract: Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In this way we extend the classical theory developed by Furstenberg and Weiss of dynamical systems indexed by the natural numbers to systems indexed by words. Moreover, applying this theory to topological systems indexed by semigroups that can be represented as words we get analogous recurrence results for such systems.
Recommendations
Cites work
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- Extended Ramsey theory for words representing rationals
- Finite sums from sequences within cells of a partition of N
- Idempotents in compact semigroups and Ramsey theory
- Some unifying principles in Ramsey theory
- Subsemigroups of Stone-Čech compactifications
- Topological dynamics and combinatorial number theory
Cited in
(7)- A multiple recurrence theorem for countable directed partial semigroup actions
- scientific article; zbMATH DE number 4168694 (Why is no real title available?)
- Topological dynamics on nets
- Rational dynamical systems
- Infinite words with uniform frequencies, and invariant measures
- Spectral analysis of transition operators, automata groups and translation in BBS
- Self-similar measures and sequences
This page was built for publication: Topological dynamics indexed by words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409662)