Related papers: Topological Dynamics indexed by words
We introduce the notion of a rational dynamical system extending the classical notion of a topological dynamical system and we prove (multiple) recurrence results for such systems via a partition theorem for the rational numbers proved by…
We prove additive and multiplicative partition theorems, obtaining combinatorial results for p-quasicyclic groups, where p is a prime number. We also get density results for p-quasicyclic groups via left F{\o}lner sequences of non-empty…
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…
A subset $A$ of $\nats$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \nats} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…
We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem.
Using a result of Behrend concerning sets without arithmetic progressions, we construct some examples of dynamical systems with slow time of multiple recurrence. Our theorem is a quatitative analog of Furstenberg's Correspondence Principle.
Furstenberg, using tools from topological dynamics, defined the notion of a central subset of positive integers, and proved a powerful combinatorial theorem about such sets. Using the algebraic structure of the Stone-\v{C}ech…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
Given a semigroup $G$ and a bounded function $f: G \to \mathbb{C}$, a topological Furstenberg system of $f$ is a topological dynamical system $\mathbb{X}=(X, (T_g)_{g \in G})$ that encodes the dynamical behaviour of $f$. We show that…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.
A subset $A$ of $\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from…
Using the combinatorial properties of subsets of integers, a classification of metric dynamical systems was given in [V. Bergelson and T. Downarowicz, Large sets of integers and hierarchy of mixing properties of measure-preserving systems,…
H. Furstenberg defined Central sets in $\mathbb{N}$ by using the notions of topological dynamics, later Bergelson and Hindman characterized central sets in $\mathbb{N}$ and also in arbitrary semigroup in terms of algebra of Stone-\v{C}ech…