Translation algorithms for graph covers
Fundamenta Mathematicae
MSC: Primary 37B05; Secondary 57H20, 37B10
DOI: 10.4064/fm231118-5-9
Opublikowany online: 20 January 2025
Streszczenie
Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g. Bratteli–Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g. non-minimality or aperiodicity are no restrictions). We give a survey on the construction, properties and some special cases of graph covers.
