Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T08:32:09.122Z Has data issue: false hasContentIssue false

The Ellis semigroup of certain constant-length substitutions

Published online by Cambridge University Press:  06 December 2019

PETRA STAYNOVA*
Affiliation:
University of Leeds Faculty of Mathematics and Physical Sciences, Mathematics, Mathematics, Leeds, LS2 9JT, UK email petra.staynova@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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].

Information

Type
Original Article
Copyright
© Cambridge University Press, 2019