Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.20291 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908057152258048 |
|---|---|
| author | Boroński, Jan Bruin, Henk Kucharski, Przemysław |
| author_facet | Boroński, Jan Bruin, Henk Kucharski, Przemysław |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_20291 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Translation algorithms for graph covers Boroński, Jan Bruin, Henk Kucharski, Przemysław Dynamical Systems 37B05, 57H20, 37B10 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. |
| title | Translation algorithms for graph covers |
| topic | Dynamical Systems 37B05, 57H20, 37B10 |
| url | https://arxiv.org/abs/2310.20291 |