Coding rotations on intervals
| dc.creator | Berstel, Jean | |
| dc.creator | Vuillon, Laurent | |
| dc.date | 2001-06-26 | |
| dc.date.accessioned | 2026-07-07T04:42:19Z | |
| dc.date.available | 2026-07-07T04:42:19Z | |
| dc.description | We show that the coding of rotation by $α$ on $m$ intervals with rationally independent lengths can be recoded over $m$ Sturmian words of angle $α.$ More precisely, for a given $m$ an universal automaton is constructed such that the edge indexed by the vector of values of the $i$th letter on each Sturmian word gives the value of the $i$th letter of the coding of rotation. | |
| dc.description | LIAFA report | |
| dc.identifier | https://arxiv.org/abs/math/0106217 | |
| dc.identifier | http://arxiv.org/abs/math/0106217 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61730 | |
| dc.subject | Combinatorics | |
| dc.subject | Dynamical Systems | |
| dc.subject | 68R15 | |
| dc.title | Coding rotations on intervals | |
| dc.type | text |