A+ CATEGORY SCIENTIFIC UNIT

PDF files of articles are only available for institutions which have paid for the online version upon signing an Institutional User License.

Translation algorithms for graph covers

Volume 268 / 2025

Jan Boroński, Henk Bruin, Przemysław Kucharski Fundamenta Mathematicae 268 (2025), 53-72 MSC: Primary 37B05; Secondary 57H20, 37B10 DOI: 10.4064/fm231118-5-9 Published online: 20 January 2025

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 aperiodicity are no restrictions). We give a survey on the construction, properties and some special cases of graph covers.

Authors

  • Jan BorońskiDepartment of Differential Equations
    Faculty of Mathematics and Computer Science
    Jagiellonian University
    30-348 Kraków, Poland
    e-mail
  • Henk BruinFaculty of Mathematics
    University of Vienna
    1090 Wien, Austria
    e-mail
  • Przemysław KucharskiDepartment of Differential Equations
    Faculty of Mathematics and Computer Science
    Jagiellonian University
    30-348 Kraków, Poland
    e-mail

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image