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

N. Pytheas Fogg, C. Noûs

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 fract…