Codings of rotations and continued fractions

DOI10.1006/jnth.1998.2246zbMath0921.11015OpenAlexW2039026476MaRDI QIDQ1273710

Gilles Didier

Publication date: 29 September 1999

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1998.2246

zbMATH Keywords

substitutionscombinatorics on wordsbinary codings of rotationscontinued-fraction-like algorithmmorphisms for Sturmian sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85) Low-dimensional dynamical systems (37E99) Metric theory of continued fractions (11K50)

Related Items (8)

Transcendence of Sturmian or morphic continued fractions ⋮ Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials ⋮ Palindromic complexity of codings of rotations ⋮ Balances for fixed points of primitive substitutions. ⋮ Rotation encoding and self-similarity phenomenon ⋮ Itineraries of rigid rotations and diffeomorphisms of the circle ⋮ Complexity for finite factors of infinite sequences ⋮ Codings of rotations on two intervals are full

Cites Work

• Frequencies of factors of Sturmian sequences
• A characterization of real quadratic numbers by diophantine algorithms
• Sequences with subword complexity \(2n\)
• Représentation géométrique de suites de complexité $2n+1$
• Beatty Sequences, Continued Fractions, and Certain Shift Operators
• Descriptions of the Characteristic Sequence of an Irrational
• On the characteristic word of the inhomogeneous Beatty sequence
• Unnamed Item
• Unnamed Item

This page was built for publication: Codings of rotations and continued fractions