Back to search

The Open University

Forward Limit Sets of Semigroups of Substitutions and Arithmetic Progressions in Automatic Sequences

Abstract

dc:description.abstract

This thesis deals with symbolic sequences generated by semigroups of substitutions acting on finite alphabets. First, we investigate the underlying structure of certain automatic sequences by studying the maximum length A(d) of the monochromatic arithmetic progressions of difference d appearing in these sequences. For example, for the Thue-Morse sequence and a class of generalised Thue-Morse sequences, we give exact values of A(d) or upper bounds on it, for certain differences d. For aperiodic, primitive, bijective substitutions and spin substitutions, which are generalisations of the Thue-Morse and Rudin-Shapiro substitutions, respectively, we study the asymptotic growth rate of A(d). In particular, we prove that there exists a subsequence (d_n) of differences along which A(d_n) grows at least polynomially in d_n. Explicit upper and lower bounds for the growth exponent can be derived from a finite group associated to the substitution considered. Next, we introduce the forward limit set Λ of a semigroup S generated by a family of substitutions of a finite alphabet, which typically coincides with the set of all possible s-adic limits of that family. We provide several alternative characterisations of the forward limit set. For instance, we prove that Λ is the unique maximal closed and strongly S-invariant subset of the space of all infinite words, and we prove that it is the closure of the image under S of the set of all fixed points of S. It is usually difficult to compute a forward limit set explicitly; however, we show that, provided certain assumptions hold, Λ is uncountable, and we supply upper bounds on its size in terms of logarithmic Hausdorff dimension.

Degree

thesis:*
Name dc:type.qualificationname
phd
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
The Open University
Year dc:date.issued
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Aedo Goñi, Ibai

Rights

Language dc:language
en

Chain of custody

source
Harvested from
The Open University
Base URL
oro.open.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Aedo Goñi, Ibai. Forward Limit Sets of Semigroups of Substitutions and Arithmetic Progressions in Automatic Sequences. doctoral thesis, The Open University, 2023.