Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Symbolic coding of linear complexity for generic translations of the torus, using continued fractions (2005.12229v1)

Published 25 May 2020 in math.DS, cs.FL, and math.NT

Abstract: 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 in projective dimension $2$. More generally, in dimension $d\geq 1$, we study extended measured continued fraction algorithms, which associate to each direction a subshift generated by substitutions, called $S$-adic subshift. We give some conditions which imply the existence, for almost every direction, of a translation of the torus $\mathbb{T}d$ and a nice generating partition, such that the associated coding is a conjugacy with the subshift.

Citations (5)

Summary

We haven't generated a summary for this paper yet.