Trajectories of rotations
A Sturmian sequence is a (necessarily binary) sequence whose block-complexity is equal to \(n+1\), i.e., a sequence which contains exactly \(n+1\) blocks of length \(n\), for all \(n\geq 1\). Sturmian sequences have been introduced by \textit{M. Morse} and \textit{G. Hedlund} [Am. J. Math. 62, 1-42 (1940; Zbl 0022.34003)], and they have many interesting properties -- let us just mention their interpretation as billiard sequences on a square, and as codings of the intersections between a straight line and the lattice \(\mathbb{Z}^2\). We suggest the survey [\textit{J. Berstel}, Recent results in Sturmian words, Developments in language theory II, J. Dassow, G. Rozenberg, and A. Salomaa (eds.) World Scientific, 13-24 (1996)] (this survey is more specific than Reference [1] quoted by the authors). The authors give a new combinatorial description of Sturmian sequences as limits of sequences of finite words obtained from the continued fraction expansion of the slopes and from the Ostrowski algorithm for the slopes and intercepts of straight lines defining the Sturmian sequences.
- scientific article; zbMATH DE number 1343488
- Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
- scientific article; zbMATH DE number 6130246
- Palindromes and two-dimensional Sturmian sequences
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Sequences of low complexity: Automatic and Sturmian sequences
- *-Sturmian words and complexity
- Double sequences of low complexity
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- A simple characterization of Sturm numbers
- Transcendence of numbers with a low complexity expansion
- Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
- A quantitative shrinking target result on Sturmian sequences for rotations
- Sturmian images of non Sturmian words and standard morphisms
- On powers of words occurring in binary codings of rotations
- On trigonometric skew-products over irrational circle-rotations
- Column representation of Sturmian words in cellular automata
- On the partitions with Sturmian-like refinements
- On complementary triples of Sturmian bisequences
- On Markoff's property and Sturmian words
- Rigidity of generalized Veech 1969/Sataev 1975 extensions of rotations
- Palindromes and two-dimensional Sturmian sequences
- Beyond Sturmian sequences: coding linear trajectories in the regular octagon
- scientific article; zbMATH DE number 3739854 (Why is no real title available?)
- Nonlinear rotations
- scientific article; zbMATH DE number 2079166 (Why is no real title available?)
- scientific article; zbMATH DE number 1525218 (Why is no real title available?)
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- Construction of Sturmian sequences
- S-adic sequences: a bridge between dynamics, arithmetic, and geometry
- Extremal properties of (epi)Sturmian sequences and distribution modulo 1
- Rotation encoding and self-similarity phenomenon
- Covering numbers: Arithmetics and dynamics for rotations and interval exchanges
- Combinatorial structure of Sturmian words and continued fraction expansion of Sturmian numbers
- The Pell tower and Ostronometry
- Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words
- Matrices of 3-iet preserving morphisms
This page was built for publication: Trajectories of rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238827)
