Complete regularity of Ellis semigroups of -actions

It is shown that the Ellis semigroup of a $\mathbb Z$ -action on a compact totally disconnected space is completely regular if and only if forward proximality coincides with forward asymptoticity and backward proximality coincides with backward asymptoticity. Furthermore, the Ellis semigroup of a $\mathbb Z$ - or $\mathbb R$ -action for which forward proximality and backward proximality are transitive relations is shown to have at most two left minimal ideals. Finally, the notion of near simplicity of the Ellis semigroup is introduced and related to the above.

The Ellis semigroup of certain constant-length substitutions

In this article, we calculate the Ellis semigroup of a certain class of constant-length substitutions. This generalizes a result of Haddad and Johnson [IP cluster points, idempotents, and recurrent sequences. Topology Proc.22 (1997) 213–226] from the binary case to substitutions over arbitrarily large finite alphabets. Moreover, we provide a class of counterexamples to one of the propositions in their paper, which is central to the proof of their main theorem. We give an alternative approach to their result, which centers on the properties of the Ellis semigroup. To do this, we also show a new way to construct an almost automorphic–isometric tower to the maximal equicontinuous factor of these systems, which gives a more particular approach than the one given by Dekking [The spectrum of dynamical systems arising from substitutions of constant length. Z. Wahrscheinlichkeitstheor. Verw. Geb.41(3) (1977/78) 221–239].

Boundedness and absoluteness of some dynamical invariants in model theory

Let [Formula: see text] be a monster model of an arbitrary theory [Formula: see text], let [Formula: see text] be any (possibly infinite) tuple of bounded length of elements of [Formula: see text], and let [Formula: see text] be an enumeration of all elements of [Formula: see text] (so a tuple of unbounded length). By [Formula: see text] we denote the compact space of all complete types over [Formula: see text] extending [Formula: see text], and [Formula: see text] is defined analogously. Then [Formula: see text] and [Formula: see text] are naturally [Formula: see text]-flows (even [Formula: see text]-ambits). We show that the Ellis groups of both these flows are of bounded size (i.e. smaller than the degree of saturation of [Formula: see text]), providing an explicit bound on this size. Next, we prove that these Ellis groups do not depend (as groups equipped with the so-called [Formula: see text]-topology) on the choice of the monster model [Formula: see text]; thus, we say that these Ellis groups are absolute. We also study minimal left ideals (equivalently subflows) of the Ellis semigroups of the flows [Formula: see text] and [Formula: see text]. We give an example of a NIP theory in which the minimal left ideals are of unbounded size. Then we show that in each of these two cases, boundedness of a minimal left ideal (equivalently, of all the minimal left ideals) is an absolute property (i.e. it does not depend on the choice of [Formula: see text]) and that whenever such an ideal is bounded, then in some sense its isomorphism type is also absolute. Under the assumption that [Formula: see text] has NIP, we give characterizations (in various terms) of when a minimal left ideal of the Ellis semigroup of [Formula: see text] is bounded. Then we adapt the proof of Theorem 5.7 in Definably amenable NIP groups, J. Amer. Math. Soc. 31 (2018) 609–641 to show that whenever such an ideal is bounded, a certain natural epimorphism (described in [K. Krupiński, A. Pillay and T. Rzepecki, Topological dynamics and the complexity of strong types, Israel J. Math. 228 (2018) 863–932]) from the Ellis group of the flow [Formula: see text] to the Kim–Pillay Galois group [Formula: see text] is an isomorphism (in particular, [Formula: see text] is G-compact). We also obtain some variants of these results, formulate some questions, and explain differences (providing a few counterexamples) which occur when the flow [Formula: see text] is replaced by [Formula: see text].