Translation algorithms for graph covers
Dynamical Systems
2024-09-24 v2
Abstract
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 aperiodicty are no restrictions). We give a survey on the construction, properties and some special cases of graph covers.
Cite
@article{arxiv.2310.20291,
title = {Translation algorithms for graph covers},
author = {Jan Boroński and Henk Bruin and Przemysław Kucharski},
journal= {arXiv preprint arXiv:2310.20291},
year = {2024}
}
Comments
Included corrections done at revision of the paper (in Fund. Math.)