Odometers in non-compact spaces
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929303687528448 |
|---|---|
| author | Iommi, Godofredo Ponce, Mario |
| author_facet | Iommi, Godofredo Ponce, Mario |
| contents | We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset of the space of one sided sequences on two symbols. We extend the action of the odometer to finite words. It turns out that, arranging the finite words in appropriate binary tree, this extension runs through the tree from left-right and top-down. Several well known binary trees made out of rational numbers, such as the Kepler tree or the Calkin and Wilf tree, are recovered in this way. Indeed, it suffices to identify finite words with rational numbers by means of certain continued fractions. The odometric action allow us to recover, in a unified way, several counting results for the rational numbers. Moreover, associated to certain interval maps with countably many branches we construct their corresponding odometers. Explicit formulas are provided in the cases of the Gauss map (continued fractions) and the Renyi map (backward continued fractions). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_03768 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Odometers in non-compact spaces Iommi, Godofredo Ponce, Mario Dynamical Systems Combinatorics We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset of the space of one sided sequences on two symbols. We extend the action of the odometer to finite words. It turns out that, arranging the finite words in appropriate binary tree, this extension runs through the tree from left-right and top-down. Several well known binary trees made out of rational numbers, such as the Kepler tree or the Calkin and Wilf tree, are recovered in this way. Indeed, it suffices to identify finite words with rational numbers by means of certain continued fractions. The odometric action allow us to recover, in a unified way, several counting results for the rational numbers. Moreover, associated to certain interval maps with countably many branches we construct their corresponding odometers. Explicit formulas are provided in the cases of the Gauss map (continued fractions) and the Renyi map (backward continued fractions). |
| title | Odometers in non-compact spaces |
| topic | Dynamical Systems Combinatorics |
| url | https://arxiv.org/abs/2404.03768 |