Symbolic coding of linear complexity for generic translations of the torus, using continued fractions

In this paper, we prove that almost every translation of $\mathbb{T}^2$ admits a symbolic coding which has linear complexity $2n+1$. The partitions are constructed with Rauzy fractals associated with sequences of substitutions, which are produced by a particular extended continued fraction algorithm...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fogg, N. Pytheas, Noûs, C
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Formal Languages and Automata Theory Mathematics - Dynamical Systems Mathematics - Number Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!