Constant length substitutions, iterated function systems and amorphic complexity

From MaRDI portal
Publication:2193049



Abstract: We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of the topological notion of amorphic complexity. For subshifts with discrete spectrum associated to constant length substitutions, this characterization allows us to derive bounds for the amorphic complexity by interpreting the subshift as the attractor of an iterated function system in a suitable quotient space. As a result, we obtain the general finiteness and positivity of amorphic complexity in this setting and provide a closed formula in case of a binary alphabet.


The purpose of the present paper is to show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime.



Cites work









This page was built for publication: Constant length substitutions, iterated function systems and amorphic complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193049)